Adjacency matrices of semigraphs and their spectral analysis

다국어 초록 (Multilingual Abstract)

We discuss Adjacency matrix and L-adjacency matrix representation of a semigraph and obtain Sach`s type theorems for semigraphs for interperting first few coefficients of the characteristic polynomial of the associated matrices in terms of semigraph parameters. We find the eigenvalues and their bounds certain classes of semigraphs. We define corresponding energies as the sum of the absolute values of the eigenvalues and also find the energy bounds.

참고문헌 (Reference)

1 G. Caprossi, "Variable neighborhood graphs: Finding graphs with extreme energy" 39 : 984-986, 1999

2 I. Gutman, "The energy of graphs" 103 : 1-22, 1978

3 I. Gutman, "The energy of a graph, Old and New results, Algebraic combinatorics and applications" Springer 2000

4 R. Balakrishnan, "The energy of a graph" 387 : 287-295, 2004

5 S. S. Kamath, "Strong and Weak Domination, and Domination Balence in Semigraphs" 15 : 112-, 2003

6 E. Sampathkumar, "Semigraphs and their applications, DST/MS/022/94"

7 E. Sampathkumar, "Matrix representation of semigraphs" 장전수학회 14 (14): 103-109, 2007

8 D. B. West, "Introduction to graph theory" PHI 20-, 2005

9 S. S. Kamath, "Domination in Semigraphs" 15 : 106-111, 2003

10 K. Kayathri, "Coloring of Complete Semigraphs" 33 (33): 605-614, 2007

11 S. P. Subbaiah, "A study of graph theory: Topology, Steiner domination and Semigraph concepts" Madurai Kamaraj University 2007

12 R. Balakrishnan, "A Text Book of Graph Theory" Springer 2012

13 Shambhulingaiah. K.S, "A Study of some topics in the theory of Semigraphs" University of Mysore 2010

14 S.M. Cioaba, "A First Course in Graph Theory and Combinatorics, TRIM 55" Hindustan Book agency 2009