Spelling suggestions: "subject:"equivalence domination"" "subject:"equivalences domination""
1 |
Equivalence Domination in GraphsArumugam, S., Chellali, Mustapha, Haynes, Teresa W. 10 September 2013 (has links)
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ V (G) \ S, there exist two vertices u, w ∈ S such that the subgraph induced by {u, v, w} is a path. The equivalence domination number is the minimum cardinality of an equivalence dominating set of G, and the upper equivalence domination number is the maximum cardinality of a minimal equivalence dominating set of G. We explore relationships between total domination and equivalence domination. Then we determine the extremal graphs having large equivalence domination numbers.
|
2 |
Equivalence Domination in GraphsArumugam, S., Chellali, Mustapha, Haynes, Teresa W. 10 September 2013 (has links)
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ V (G) \ S, there exist two vertices u, w ∈ S such that the subgraph induced by {u, v, w} is a path. The equivalence domination number is the minimum cardinality of an equivalence dominating set of G, and the upper equivalence domination number is the maximum cardinality of a minimal equivalence dominating set of G. We explore relationships between total domination and equivalence domination. Then we determine the extremal graphs having large equivalence domination numbers.
|
Page generated in 0.0821 seconds