|
Accession number;03A0275213
|
| Title;On Maximal Cycles of Graphs |
| Author;
LEE Y
(Tokai Univ.)
|
Journal Title;Proc Sch Sci Tokai Univ
|
Journal Code:S0439A
|
ISSN:0919-5025
|
|
VOL.38;NO.;PAGE.1-12(2003)
|
| Figure&Table&Reference;REF.5 |
| Pub. Country;Japan |
| Language;English |
| Abstract;For a graph G, a subset z of the edge-set E (G) is called a cycle if for every vertex v of G the number of elements of z incident to v is even. A cycle of G is called to be maximal if it is maximal in the set of cycles by means of set inclusion. In this paper, we first give elementary facts and general facts. The concept of regularity is introduced and its brief application to the coloring problem is presented. Next, a characterization of complete graphs is given. Finally, we give some results on parity of numbers. (author abst.) |
|
|
|
Related Articles;
|
|
