Finding a minimum dominating set by transforming domination of vertices.
Saoud, Mahmoud, Jebran, Jebran (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Boundary domination in graphs”
Finding a minimum dominating set by transforming domination of vertices.
On the number of cut-vertices in a graph.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distance in graphs
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
The Hadwiger number of an infinite graph
Bohdan Zelinka (1976)
Mathematica Slovaca
Similarity:
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: