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:
Displaying similar documents to “Forcing signed domination numbers in graphs.”
Computing the domination number of grid graphs.
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:
On graphs whose reduced energy does not exceed 3.
Lazić, Mirjana (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Signed total -domatic numbers of digraphs
Maryam Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann (2011)
Kragujevac Journal of Mathematics
Similarity:
Path partitions of planar graphs.
Glebov, A.N., Zambalaeva, D.Zh. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Biembeddings of symmetric configurations and 3-homogeneous Latin trades
Mike J. Grannell, Terry S. Griggs, Martin Knor (2008)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.
Introduction to association schemes.
Seidel, J.J. (1991)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Hosoya polynomial of Hanoi graphs
Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
The graph of generating sets of an abelian group
Persi Diaconis, Ronald Graham (1999)
Colloquium Mathematicae
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: