The tau constant of a metrized graph and its behavior under graph operations.
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Angelini, Patrizio, Frati, Fabrizio, Grilli, Luca (2010)
Journal of Graph Algorithms and Applications
Similarity:
Galvin, David J. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
József Beck (1989)
Compositio Mathematica
Similarity:
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eric Andrews, Chira Lumduanhom, Ping Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even. An Eulerian walk in a connected graph G is a closed walk that contains every edge of G at least once, while an irregular Eulerian walk in G is an Eulerian walk that encounters no two edges of G the same number of times. The minimum...
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated. ...
Pezarski, Andrzej, Zmarz, Michał (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: