Graphs with smallest sum of squares of vertex degrees
Ivan Gutman (2003)
Kragujevac Journal of Mathematics
Similarity:
Ivan Gutman (2003)
Kragujevac Journal of Mathematics
Similarity:
Marinescu-Ghemeci, Ruxandra, Mihai, Gabriela (2011)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Knor, M., Niepel, L'. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Harishchandra S. Ramane, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
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:
Yong Wang, Xueliang Li, Ivan Gutman (2001)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković, Mirko Lepović (2005)
Publications de l'Institut Mathématique
Similarity: