On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Mieczysław Borowiecki, Danuta Michalak, Elżbieta Sidorowicz (1997)
Discussiones Mathematicae Graph Theory
Similarity:
The purpose of this paper is to present some basic properties of 𝓟-dominating, 𝓟-independent, and 𝓟-irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Robert Janczewski, Michał Małafiejski, Anna Małafiejska (2018)
Discussiones Mathematicae Graph Theory
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
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.
Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)
Discussiones Mathematicae Graph Theory
Similarity:
Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A. Hajnal (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
Ivica Bošnjak, Rozália Madarász (2018)
Czechoslovak Mathematical Journal
Similarity:
For a class of graphs we say that it is globally determined if any two nonisomorphic graphs from that class have nonisomorphic globals. We will prove that the class of so called CCB graphs and the class of finite forests are globally determined.
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
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.
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.