New classification of graphs in view of the domination number of central graphs

preprint2022arXivOpen access

Abstract

For a graph GG, the central graph C(G)C(G) is the graph constructed from GG by subdividing each edge of GG with one vertex and also by adding an edge to every pair of non-adjacent vertices in GG. Also for a graph GG, let γ(G)γ(G) and τ(G)τ(G) be the domination number of GG and the minimum cardinarity of a vertex cover of GG, respectively. In this paper, we give a new classification of graphs concerning the domination number of central graphs and minimum vertex covers of graphs. Namely, we show that any graph GG with at least three vertices can be classified into one of the two classes of graphs with γ(C(G))=τ(G)γ(C(G))=τ(G) and γ(C(G))=τ(G)+1γ(C(G))=τ(G)+1, respectively, together with some special properties concerning a vertex cover of GG. We also give some new results on the domination number of central graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.