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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Diameter in walk graphs.”
Extremal graph theory for metric dimension and diameter.
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:
The number of spanning trees of double graphs
Liu Wu-xin, Wei Fu-yi (2011)
Kragujevac Journal of Mathematics
Similarity:
Toughness of -minor-free graphs.
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)
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 spectral radius of bicyclic graphs
M. Petrović, I. Gutman, Shu-Guang Guo (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Ore type condition and Hamiltonian graphs
Kewen Zhao (2013)
Matematički Vesnik
Similarity:
Nonmonotonic coexistence regions for the two-type Richardson model on graphs.
Deijfen, Maria, Häggström, Olle (2006)
Electronic Journal of Probability [electronic only]
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.) ...
The factor for multi-dimensional lattice paths with diagonal steps.
Duchi, E., Sulanke, R.A. (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: