Graphs with prescribed size and vertex parities
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
Juan Alberto Rodríguez-Velázquez, Erick David Rodríguez-Bazan, Alejandro Estrada-Moreno (2017)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
DeLaVina, Ermelinda, Fajtlowicz, Siemion (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vladimír Baláž, Jaroslav Koča, Vladimír Kvasnička, Milan Sekanina (1986)
Časopis pro pěstování matematiky
Similarity:
Gerd H. Fricke, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson (2011)
Discussiones Mathematicae Graph Theory
Similarity:
A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ)...
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.
Teresa Haynes, Michael Henning (2012)
Open Mathematics
Similarity:
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. In this paper we characterize the diameter-2-critical graphs with no antihole of length four, that is, the diameter-2-critical graphs whose complements have no induced 4-cycle. Murty and Simon conjectured that the number of edges in a diameter-2-critical graph of order n is at most n 2/4 and that the extremal graphs are complete bipartite graphs with equal size partite sets. As...
Yu, Yaming (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yong Wang, Xueliang Li, Ivan Gutman (2001)
Publications de l'Institut Mathématique
Similarity: