An exposition on Eulerian irregularity in graphs
In this paper, we present an exposition of the first two sections in the article, On Eulerian Irregularity in Graphs . In the Chinese Postman Problem, we are asked to find the minimum length of a closed walk in a connected graph G such that every edge of G appears on the walk once or twice. Another...
Saved in:
Main Authors: | Cheng, Janelle C., Mijares, Nicole G. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2015
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18388 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Notions of domination for some classses of graphs
by: Castaneda, Adrian Timothy S., et al.
Published: (2015) -
Primitive and universal graphs: An exposition
by: Ibaviosa, Erica Zinnia, et al.
Published: (2008) -
On distance and size of Eulerian and bipartite digraphs
by: Ong, Symoun Israel A., et al.
Published: (2016) -
Some characterizations of Eulerian and Hamiltonian graphs
by: Andrada, Philip Gabriel Y., et al.
Published: (2006) -
Smallest regular graphs with irregular squares
by: Alba, Alvin P., et al.
Published: (1992)