Scribd
Upload
118 views2 pages

Conjectures on Graph Color Spectral Radius

The document conjectures four bounds on the color spectral radius of graphs based on properties of the color matrix of a graph. The color spectral radius is the largest eigenvalue of the color matrix, which generalizes the adjacency matrix. The conjectures propose that the color spectral radius is bounded above and below based on sums of vertex degrees and the first Zagreb index of the graph. Proving the conjectures would require considering a fixed graph coloring algorithm.

Uploaded by

Slobodan Milutinovic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
118 views2 pages

Conjectures on Graph Color Spectral Radius

The document conjectures four bounds on the color spectral radius of graphs based on properties of the color matrix of a graph. The color spectral radius is the largest eigenvalue of the color matrix, which generalizes the adjacency matrix. The conjectures propose that the color spectral radius is bounded above and below based on sums of vertex degrees and the first Zagreb index of the graph. Proving the conjectures would require considering a fixed graph coloring algorithm.

Uploaded by

Slobodan Milutinovic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Some Conjectures on Color Spectral Radius of Graph

K.S. Betageri

Research Scholar Dept. of Mathematics,


Karnataka University Dharwad, Karnataka, India,
Email: [email protected]

Abstract: Recently C. Adiga and et.al., have introduced and investigated many
topological properties in relations with color eigenvalues and color energy of a graph [1]. Here
we conjecture some new bounds for color spectral radius of graphs and equality in every bound
discussed holds for colored graph whence colored graph is 𝐾𝑛 . We also noticed that, all
conjectures are true for other (regular and non regular) graphs.

1.0 Necessary definitions

Let 𝐺 be a graph of order 𝑛 with vertex set 𝑉(𝐺) = {𝑣1 , 𝑣2 , , 𝑣𝑛 , } and edge set E(𝐺) = {𝑣1 , 𝑣2 , . . , 𝑣𝑛 , }.
The 𝑑(𝑣𝑖 ) or 𝑑𝑖 is the vertex degree of graph 𝐺. The first Zagreb index is 𝑀1 (𝐺) is the sum of
the squares of degrees in 𝐺.

Definition 1 [1] (Color Matrix): The color matrix 𝐴𝑐 (𝐺) = [𝑎𝑖𝑗 ] of 𝐺 is a square matrix of order
whose (𝑖, 𝑗)-entries are as follows

1, 𝑖𝑓 𝑣𝑖 𝑎𝑛𝑑 𝑣𝑗 𝑎𝑟𝑒 𝑎𝑑𝑗𝑎𝑐𝑒𝑛𝑡 𝑤𝑖𝑡ℎ 𝑐(𝑣𝑖 ) ≠ 𝑐(𝑣𝑗 )


[𝑎𝑖𝑗 ] = {−1, 𝑖𝑓 𝑣𝑖 𝑎𝑛𝑑 𝑣𝑗 𝑎𝑟𝑒 𝑛𝑜𝑡 𝑎𝑑𝑗𝑎𝑐𝑒𝑛𝑡 𝑤𝑖𝑡ℎ 𝑐(𝑣𝑖 ) = 𝑐(𝑣𝑗 )
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

In the case that, 𝐺 is simple graph of order 𝑛 and 𝑚, the color matrix 𝐴𝑐 (𝐺) will be (−1, 0, 1) matrix
with respect to a given coloring. Suppose that

𝑃𝑐 (𝐺, 𝜆) = det(𝜆𝐼 − 𝐴𝑐 (𝐺)) = 𝑎0 𝜆𝑛 + 𝑎1 𝜆𝑛−1 + 𝑎2 𝜆𝑛−2 + 𝑎3 𝜆𝑛−3 + ⋯ … . +𝑎0

is the characteristic polynomial of 𝐴𝑐 (𝐺). Let 𝜆1 ≥ 𝜆2 ≥ ⋯ ≥ 𝜆𝑛 be the color eigenvalues of 𝐺,


i.e., the roots of 𝑃𝑐 (𝐺, 𝜆). The color spectrum of 𝐺 is defined as the set of color eigenvalues of
𝐴𝑐 (𝐺) together with their multiplicities. The 𝜆1 is color spectral radius of graphs 𝐺.
1.1 Some Conjectures on Color Spectral Radius of Graph
In this section we present four conjectures based on the fact that, color matrix is generalization of
adjacency matrix [1] and equality holds in all conjectures with 𝐺 = 𝐾𝑛 .

Conjecture 1. For any graph 𝐺(𝑛, 𝑚) with 𝑚𝑐′ vertices.


∑𝑖~𝑗 √𝑑𝑖 𝑑𝑗
𝜆1 (𝐺) ≥ (𝑚+𝑚𝑐′ )
.

Conjecture 2. For any non trivial connected graph 𝐺(𝑛, 𝑚) with 𝑚𝑐′ vertices.

(𝑚+𝑚𝑐′ )
𝜆1 (𝐺) ≤ √∑ .
𝑖~𝑗 𝑑𝑖 𝑑𝑗

Conjecture 3. For any non trivial connected graph with 𝑛 vertices


𝑚1 (𝐺)
𝜆1 (𝐺) ≤ , where 𝑚1 (𝐺) = ∑𝑛𝑖=1 𝑑𝑖 2 .
𝑛

Conjecture 4. For any non trivial connected graph with 𝑛 vertices


𝑑𝑖 +𝑑𝑗
𝜆1 (𝐺) ≤ max { }.
𝑖~𝑗 𝑛

Conclusion: Since any graph can be colored infinitely many ways if we cannot constraint
under some conditions. So one can consider a proper coloring with a fixed algorithm and
construct or develop proofs of the above conjectures.

1. C. Adiga, E. Sampathkumar, M. A. Sriraj, Color Energy of a Graph, Proc. Jangjeon


Math. Soc., 16 (3), 335-351 (2013).

You might also like