On the upper bounds for the first Zagreb index
Aleksandar Ilić, Milovan Ilić, Bolian Liu (2011)
Kragujevac Journal of Mathematics
Similarity:
Displaying similar documents to “Signed total distance -domatic numbers of graphs”
On the upper bounds for the first Zagreb index
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Extremal graph theory for metric dimension and diameter.
Hernando, Carmen, Mora, Mercè, Pelayo, Ignacio M., Seara, Carlos, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Forcing signed domination numbers in graphs.
Sheikholeslami, S.M. (2007)
Matematichki Vesnik
Similarity:
Hosoya polynomial of Hanoi graphs
Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
A conjecture of Biggs concerning the resistance of a distance-regular graph.
Markowsky, Greg, Koolen, Jacobus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Signed total -domatic numbers of digraphs
Maryam Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann (2011)
Kragujevac Journal of Mathematics
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On oriented graph scores
S. Pirzada, M. Merajuddin, U. Samee (2008)
Matematički Vesnik
Similarity:
Note on Estrada and -Estrada indices of graphs
G. H. Fath-Tabar, A. R. Ashrafi, I. Gutman (2009)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
On the isoperimetry of graphs with many ends
Christophe Pittet (1998)
Colloquium Mathematicae
Similarity:
Let X be a connected graph with uniformly bounded degree. We show that if there is a radius r such that, by removing from X any ball of radius r, we get at least three unbounded connected components, then X satisfies a strong isoperimetric inequality. In particular, the non-reduced -cohomology of X coincides with the reduced -cohomology of X and is of uncountable dimension. (Those facts are well known when X is the Cayley graph of a finitely generated group with infinitely many ends.) ...