Excellent γ - stable graphs

Yamuna, M.; Karthika, K.

doi:10.1088/1757-899x/263/4/042116

Cited by 2 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Domination dot stable graph was introduced by Yamuna et al [62]. A graph G is said to be domination dot stable (DDS) if γ(G • uv) = γ(G) for all u, v ∈ V(G), u adjacent to v. In 2006, Yamuna et al provided a constructive characterization of DDS trees.…”

Section: Domination Dot Stable Graphsmentioning

confidence: 99%

A Survey on Characterizing Trees Using Domination Number

Yamuna

Karthika

2022

Mathematics

View full text Add to dashboard Cite

Ever since the discovery of domination numbers by Claude Berge in the year 1958, graph domination has become an important domain in graph theory that has strengthened itself as a theory and has extended its contributions to various applications. Tree characterization is an important problem in graph domination. This survey focuses on presenting a collection of results on characterizing trees using domination number.

show abstract

Section: Domination Dot Stable Graphsmentioning

confidence: 99%

A Survey on Characterizing Trees Using Domination Number

Yamuna

Karthika

2022

Mathematics

View full text Add to dashboard Cite

show abstract

“…A graph G is said to be domination dot stable ( DDS ) if  ( G  uv ) =  ( G ), for all u, v  V ( G ), u  v. A necessary and sufficient condition was proved in [44].…”

Section: ) Domination Dot Stable Graphsmentioning

confidence: 99%

A Survey on the Effect of Graph Operations on the Domination Number of a Graph

Yamuna¹,

Karthika²

2016

IJET

View full text Add to dashboard Cite

Abstract-A dominating set of G is a set of vertices of G such that every vertex in V -D is adjacent to a vertex in D.The domination number of G, denoted by  ( G ), is the minimum cardinality of a dominating set. Different kinds of graph operations have different outcomes on the domination number of a graph. In this paper we present a brief survey on the impact of different kinds of graph operation on the domination number of a graph.Keyword -Domination, Domination Number, Graph Operation. I. INTRODUCTIONThe study of domination number in graph theory was introduced by Claude Berge in 1958, on his book "Theory of Graphs and its Applications" [1]. But domination number was studied in the name of coefficient of external stability. At the first time the name dominating set and domination number was used by Oyestein Ore in [2]. At the beginning stage the domination number was denoted by d ( G ). Later, in 1977, the notation  ( G ) is used to denote the domination number in Since the evolution of domination theory, types of domination are also established and studied by many researchers. But the original dominating set is the base for all types of domination. Different kinds of graph operations change the graphs and hence influence the domination number of the graph also. In this survey we concentrate on the effect of various kinds of graph operations on the domination number. There are several results relating graph operations and different types of domination. But we restrict our survey only to graph operations and dominating sets. Several results are available in this regard, and many have been omitted in this brief survey. We apologize to the authors for the omission. Many results omitted here can be found in [4][5] and in the articles in the reference section. This survey is restricted to presentation of possible results that describe the effects of the graph operations on the domination number of a graph. The connectivity k = k ( G ) of a graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph. A set of independent edges in a graph G is called a matching of G. A 1 -factor or a perfect matching of a graph is a partition of its vertices into adjacent pairs. II. GRAPH THEORY TERMINOLOGY AND CONCEPTSP n , C n , K n , denotes the path, cycle and complete graph with n vertices respectively. The wheel graph is denoted by W n , and it is defined as K 1 + C n -1 . We denote the radius and diameter of G by rad( G ) and diam ( G ), respectively. The minimum and maximum degree on the vertices of G is denoted by  ( G ) and  ( G ) respectively. If  ( G ) =  ( G ) = r, then all points have the same degree and G is called regular of degree r. The regular graphs are those of degree 3, such graphs are called cubic. The complement G of a graph G also has V ( G ) as its vertex set, but two vertices are adjacent in G if and only if they are not adjacent in G.

show abstract

Excellent γ - stable graphs

Cited by 2 publications

References 1 publication

A Survey on Characterizing Trees Using Domination Number

A Survey on Characterizing Trees Using Domination Number

A Survey on the Effect of Graph Operations on the Domination Number of a Graph

Contact Info

Product

Resources

About