Randic type additive connectivity energy of a graph
Автор: Madhusudhan Krishnarajapete Venkatarama, Reddy Polaepalli Siva Kota, Rajanna Karpenahalli Ranganathappa
Журнал: Владикавказский математический журнал @vmj-ru
Статья в выпуске: 2 т.21, 2019 года.
Бесплатный доступ
The Randic type additive connectivity matrix of the graph G of order n and size m is defined as RA(G)=(Rij), where Rij=√di+√dj if the vertices vi and vj are adjacent, and Rij=0 if vi and vj are not adjacent, where di and dj be the degrees of vertices vi and vj respectively. The purpose of this paper is to introduce and investigate the Randic type additive connectivity energy of a graph. In this paper, we obtain new inequalities involving the Randic type additive connectivity energy and presented upper and lower bounds for the Randic type additive connectivity energy of a graph. We also report results on Randic type additive connectivity energy of generalized complements of a graph.
Randic type additive connectivity energy, randic type additive connectivity eigenvalues
Короткий адрес: https://sciup.org/143168795
IDR: 143168795 | DOI: 10.23671/VNC.2019.2.32113
Список литературы Randic type additive connectivity energy of a graph
- Gutman, I. The Energy of a Graph, Ber. Math. Stat. Sekt. Forschungsz. Graz, 1978, vol. 103, pp. 1-22.
- Gutman, I. The Energy of a Graph: Old and New Results, Algebraic Combinatorics and its Applications/eds. Betten, A., et al., Berlin, Springer-Verlag, 2001, pp. 196-211.
- Prakasha, K. N., Siva Kota Reddy, P. and Cangul, I. N. Minimum Covering Randic Energy of a Graph, Kyungpook Math. J., 2017, vol. 57, no. 4, pp. 701-709.
- Siva Kota Reddy, P., Prakasha, K. N. and Siddalingaswamy, V. M. Minimum Dominating Randic Energy of a Graph, Vladikavkaz. Math. J., vol. 19, no. 1, pp. 28-35. DOI 10.23671/VNC.2017.2.6506.
- Sampathkumar, E., Pushpalatha, L., Venkatachalam, C. V. and Pradeep Bhat, Generalized Complements of a Graph, Indian J. Pure Appl. Math., 1998, vol. 29, no. 6, pp. 625-639.
