The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A note on circuit graphs.”

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Sagnik Sen (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

Nullity of Graphs

Bijana Borovićanin, Ivan Gutman (2009)

Zbornik Radova

Similarity:

On eulerian irregularity in graphs

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...