|
This article is cited in 1 scientific paper (total in 1 paper)
Randic type additive connectivity energy of a graph
K. V. Madhusudhana, P. Siva Kota Reddyb, K. R. Rajannac a ATME College of Engineering, Mysore 570 028, Karnataka, India
b Siddaganga Institute of Technology, B. H. Road, Tumkur 572 103, Karnataka, India
c Acharya Institute of Technology, Bangalore 560 107, Karnataka, India
Abstract:
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.
Key words:
Randic type additive connectivity energy, Randic type additive connectivity eigenvalues.
Received: 07.09.2018
Citation:
K. V. Madhusudhan, P. Siva Kota Reddy, K. R. Rajanna, “Randic type additive connectivity energy of a graph”, Vladikavkaz. Mat. Zh., 21:2 (2019), 18–26
Linking options:
https://www.mathnet.ru/eng/vmj690 https://www.mathnet.ru/eng/vmj/v21/i2/p18
|
Statistics & downloads: |
Abstract page: | 246 | Full-text PDF : | 50 | References: | 42 |
|