Abstract

Semigraph is a generalization of graph, with two or more vertices on edgeswhich allows multiplicity in every concept of graph when it comes to semigraph. Whennumber of vertices on the edges are restricted to two the semigraph is a graph, so everygraph is a semigraph. In this article we deal with the variety of bipartite semigraphs,namely bipartite, s-bipartite and e-bipartite and bounds for their domination number(adjacent domination number and end vertex adjacent domination number) in particu-lar when the semigraph is a cycle and also about possible size of the bipartite sets whenthe bipartite semigraph is a cycle.

Original languageEnglish
Pages (from-to)167-175
Number of pages9
JournalTurkish World Mathematical Society Journal of Applied and Engineering Mathematics
Volume12
Issue number1
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Numerical Analysis
  • Mathematical Physics
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'DOMINATION NUMBER OF A BIPARTITE SEMIGRAPH WHEN IT IS A CYCLE'. Together they form a unique fingerprint.

Cite this