Graph Invariants and Large Cycles - a Catalog of Pure Links

Details Graph Invariants and Large Cycles - a Catalog of Pure Links Graph Invariants and Large Cycles - a Catalog of Pure Links

2010-02-24

arxiv.org/abs/1002.4501v3

Mathematics

Combinatorics

15 pages, extended version

Scientific paper

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle structures, factors, matchings, colorings, coverings, and so on, whose discovery is the primary problem of graph theory. The major goal of this paper is to catalogue all pure relations between basic invariants of a graph and its large cycle structures, namely Hamilton, longest and dominating cycles and some their generalizations. Basic graph invariants and pure relations allow to focus on results having no forerunners. These simplest kind of "ancestors" form a source from which nearly all possible hamiltonian results can be developed further by various additional new ideas, generalizations, extensions, restrictions and structural limitations, as well as helping researchers to make clear and simple imagination about "complicated" developmental mechanisms in the area.

Affiliated with

Also associated with

No associations

Rating

Graph Invariants and Large Cycles - a Catalog of Pure Links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Invariants and Large Cycles - a Catalog of Pure Links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Invariants and Large Cycles - a Catalog of Pure Links will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260459