2018
DOI: 10.5937/spsunp1802099z
|View full text |Cite
|
Sign up to set email alerts
|

Randić degree-based energy of graphs

Abstract: Let G = (V, E), V = {1, 2,. .. , n}, be a simple graph of order n and size m, without isolated vertices. Denote by ∆ = d 1 ≥ d 2 ≥ • • • ≥ d n = δ > 0, d i = d(i), a sequence of its vertex degrees. If vertices i and j are adjacent, we write i ∼ j. With T I we denote a topological index that can be represented as T I = T I(G) = ∑ i∼ j F(d i , d j), where F is an appropriately chosen function with the property F(x, y) = F(y, x). Randić degree-based adjacency matrix RA = (r i j) is defined as r i j = F(d i ,d j) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 12 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?