2013
DOI: 10.1166/jctn.2013.3188
|View full text |Cite
|
Sign up to set email alerts
|

The Edge Geometric-Arithmetic Index of an Infinite Class of Dendrimers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…where d G (e) denotes the degree of the edge e in G [9,12]. The line graph L(G) of a graph G is a graph such that each vertex of L(G) represents an edge of G, and any two vertices of L(G) are adjacent if and only if their edges are incident, meaning they share a common end vertex, in graph G [1,2,17].…”
Section: Introductionmentioning
confidence: 99%
“…where d G (e) denotes the degree of the edge e in G [9,12]. The line graph L(G) of a graph G is a graph such that each vertex of L(G) represents an edge of G, and any two vertices of L(G) are adjacent if and only if their edges are incident, meaning they share a common end vertex, in graph G [1,2,17].…”
Section: Introductionmentioning
confidence: 99%