Forcing signed domination numbers in graphs.
Sheikholeslami, S.M. (2007)
Matematichki Vesnik
Similarity:
Displaying similar documents to “Extremal graph theory for metric dimension and diameter.”
Forcing signed domination numbers in graphs.
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:
Computing the domination number of grid graphs.
Alanko, Samu, Crevals, Simon, Isopoussu, Anton, Östergård, Patric, Pettersson, Ville (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.
Bernardi, Olivier (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
A New Proof of the Szeged-Wiener Theorem
H. Khodashenas, M. J. Nadjafi-Arani, A. R. Ashrafi, I. Gutman (2011)
Kragujevac Journal of Mathematics
Similarity:
Reflected Brownian motion in a wedge: sum-of-exponential stationary densities.
Dieker, A.B., Moriarty, J. (2009)
Electronic Communications in Probability [electronic only]
Similarity:
On graphs whose reduced energy does not exceed 3.
Lazić, Mirjana (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On oriented graph scores
S. Pirzada, M. Merajuddin, U. Samee (2008)
Matematički Vesnik
Similarity:
The edge-minimal polyhedral maps of Euler characteristic .
Brehm, Ulrich, Datta, Basudeb, Nilakantan, Nandini (2002)
Beiträge zur Algebra und Geometrie
Similarity:
Combinatorial aspects of an exact sequence that is related to a graphs.
Hofmeister, M. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Introduction to association schemes.
Seidel, J.J. (1991)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: