Combinatorics and Graph Theory

1504 Submissions

[2] viXra:1504.0232 [pdf] submitted on 2015-04-29 05:17:22

The Eigen-3-Cover Ratio of Graphs: Asymptotes, Domination and Areas

Authors: Carol Lynne Jessop, Paul August Winter
Comments: 23 Pages.

The separate study of the two concepts of energy and vertex coverings of graphs has opened many avenues of research. In this paper we combine these two concepts in a ratio, called the eigen-3-cover ratio, to investigate the domination effect of the subgraph induced by a vertex 3-covering of a graph (called the 3-cover graph of ), on the original energy of , where large number of vertices are involved. This is referred to as the eigen-3-cover domination and has relevance, in terms of conservation of energy, when a molecule’s atoms and bonds are mapped onto a graph with vertices and edges, respectively. If this energy-3-cover ratio is a function of , the order of graphs belonging to a class of graph, then we discuss its horizontal asymptotic behavior and attach the graphs average degree to the Riemann integral of this ratio, thus associating eigen-3-cover area with classes of graphs. We found that the eigen-3-cover domination had a strongest effect on the complete graph, while this eigen-3-cover domination had zero effect on star graphs. We show that the eigen-3-cover asymptote of discussed classes of graphs belong to the interval [0,1], and conjecture that the class of complete graphs has the largest eigen-3-cover area of all classes of graphs.
Category: Combinatorics and Graph Theory

[1] viXra:1504.0216 [pdf] submitted on 2015-04-28 00:05:36

Negating Four Color Theorem with Neutrosophy and Quad-stage Method

Authors: Fu Yuhua
Comments: 5 Pages.

With the help of Neutrosophy and Quad-stage Method, the proof for negation of “the four color theorem” is given. In which the key issue is to consider the color of the boundary, thus “the two color theorem” and “the five color theorem” are derived to replace "the four color theorem".
Category: Combinatorics and Graph Theory