Search

Start Over Subject independent domination

1. A note on the independent domination number versus the domination number in bipartite graphs

Creator:
Wang, Shaohui and Wei, Bing
Format:
print, bez média, and svazek
Type:
model:article and TEXT
Subject:
matematika, mathematics, domination, independent domination, 13, and 51
Language:
English
Description:
Let (G) and i(G) be the domination number and the independent domination number of G, respectively. Rad and Volkmann posted a conjecture that i(G)/ (G) 6 (G)/2 for any graph G, where (G) is its maximum degree (see N. J.Rad, L.Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than (G)/2 are provided as well., Shaohui Wang, Bing Wei., and Seznam literatury
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

2. Domination with respect to nondegenerate and hereditary properties

Creator:
Samodivkin, Vladimir
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
domination, independent domination, acyclic domination, good vertex, bad vertex, fixed vertex, free vertex, hereditary graph property, induced-hereditary graph property, nondegenerate graph property, and additive graph property
Language:
English
Description:
For a graphical property P and a graph G, a subset S of vertices of G is a P-set if the subgraph induced by S has the property P. The domination number with respect to the property P, is the minimum cardinality of a dominating P-set. In this paper we present results on changing and unchanging of the domination number with respect to the nondegenerate and hereditary properties when a graph is modified by adding an edge or deleting a vertex.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public