MAXIMUM DEGREE ENERGY
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, maximum degree energy of graphs is studied. After giving some preliminary new results, bounds for the maximum degree eigenvalues are obtained for a general graph. Also bounds on the maximum degree eigenvalues of some frequently used graph classes are given by means of combinatorial, number theoretical and analysis methods. Many proofs are established by means of some result obtained by Adiga and Smitha. Maximum degree energy is calculated for any given simple graph and also for some classes of graphs and obtained relations with others. Special emphasis is given to unicyclic graphs. Several unicyclic graph classes are dened and their maximum degree eigenvalues and energy are calculated.
Abstract
In this paper, maximum degree energy of graphs is studied. After giving some preliminary new results, bounds for the maximum degree eigenvalues are obtained for a general graph. Also bounds on the maximum degree eigenvalues of some frequently used graph classes are given by means of combinatorial, number theoretical and analysis methods. Many proofs are established by means of some result obtained by Adiga and Smitha. Maximum degree energy is calculated for any given simple graph and also for some classes of graphs and obtained relations with others. Special emphasis is given to unicyclic graphs. Several unicyclic graph classes are dened and their maximum degree eigenvalues and energy are calculated.
참고문헌 (15)
- I. Gutman, "The energy of a graph", Ber. Math.-Stats. Sekt. Forsch. Graz, 103(100-105), pp.22~ (1978)
- I. Gutman, "No Huckel graph is hyperenergetic", J. Serb. Chem. Soc., 65, pp.799~801 (2000)
- H. B. Walikar, "Graph Theory Notes", New York Acad. Sci., 41, pp.14~16 (2001)
- I. Gutman, "Remark on the moment expansion of total p-electron energy", Theor. Chim. Acta, 83, pp.313~318 (1992)
- I. Gutman, "The Energy of a Graph: Old and New Results, Algebraic Combinatorics and Applications", pp.197~212 (2001), Springer
- I. Gutman, "The energy of a graph and its size dependence:A Monte Carlo approach", Chem. Phys. Lett., 297, pp.428~432 (1998)
- R. Balakrishnan, "The Energy of a graph", Linear Algebra and its Applications, 387, pp.287~295 (2004)
- H. B. Walikar, "Energy of some cluster graphs", Kragujevac J. Sci., 23, pp.51~62 (2001)
- S. Pirzada, "Energy of a graph is never the square root of an odd integer", Appl. Anal. Discr. Math., 2, pp.118~121 (2008)
- R. B. Bapat, "Energy of a graph is never an odd integer", Bull. Kerala Math. Assoc., 1, pp.129~132 (2004)
- C. Adiga, "On Maximum Degree Energy of a Graph", Int. J. Contemp. Math. Sciences, 4(8), pp.385~396 (2009)
- N. Ozeki, "On the estimation of inequalities by maximum and minimum values", J. College Arts and Science, Chilba Univ., 5, pp.199~203 (1968)
- M. Biernacki, "Sur une inequalite entre des integrals definies", Maria Curie Sklodowska Univ., A4, pp.1~4 (1950)
- G. Polya, "Problems and Theorems in Analysis, Series, Integral Calculus, Theory of Functions" (1972), Springer
- S. Kouachi, "Eigenvalues and Eigenvectors of Tridiagonal Matrices", Electronic Journal of Linear Algebra, 15, pp.115~133 (2006)
