Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Displaying similar documents to “Calculating the number of the linear factors in planar graphs.”
Expected lengths of minimum spanning trees for non-identical edge distributions.
Derived graphs of some graphs
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
A not on dominating set with Maple.
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph
Piotr Rudnicki, Lorna Stewart (2012)
Formalized Mathematics
Similarity:
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of similar material is in [15].
On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
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:
On second-stage spectrum and energy of a graph
Singaraj K. Ayyaswamy, Selvaraj Balachandran, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
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:
Total weight choosability of graphs.
Przybyło, Jakub, Woźniak, Mariusz (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Optimization and Highly Informative Graph Invariants
Dragoš Cvetković, Mirjana Čangalović, Vera Kovačević-Vujčić (2004)
Zbornik Radova
Similarity: