'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Piwakowski, Konrad (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Igor' E. Zverovich, Olga I. Zverovich (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.
Grady D. Bullington, Linda L. Eroh, Steven J. Winters (2010)
Discussiones Mathematicae Graph Theory
Similarity:
Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
José D. Alvarado, Simone Dantas, Dieter Rautenbach (2017)
Discussiones Mathematicae Graph Theory
Similarity:
For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013) 806-812] present some kind of characterization of the graphs G for which R(G) − yr2(G) = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize...
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Gary Chartrand, Donald L. Goldsmith, Seymour Schuster (1979)
Colloquium Mathematicae
Similarity: