The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
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 “Graph connectivity and Wiener index”
The complexity of obtaining a distance-balanced graph.
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (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:
The -labeling on total graphs of complete multipartite graphs.
Marinescu-Ghemeci, Ruxandra, Mihai, Gabriela (2011)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
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:
The graph of labellings of a given graph
Bohdan Zelinka (1988)
Mathematica Slovaca
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:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity: