2022
DOI: 10.17485/ijst/v15i15.37
|View full text |Cite
|
Sign up to set email alerts
|

Glued Hypertree: Comparative Analysis and Distance-Based Topological Descriptors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The edges partition into Θ * classes and let {F i ; 1 ≤ i ≤ k} is the Θ * partition set of E(G). Using Θ * relation, we can find the topological indices of any graph [1,2,20,21,14].…”
Section: Topological Indices Mathematical Expressionsmentioning
confidence: 99%
“…The edges partition into Θ * classes and let {F i ; 1 ≤ i ≤ k} is the Θ * partition set of E(G). Using Θ * relation, we can find the topological indices of any graph [1,2,20,21,14].…”
Section: Topological Indices Mathematical Expressionsmentioning
confidence: 99%
“…e edges partition into Θ * classes and let F i ; 1 ≤ i ≤ k 􏼈 􏼉 is the Θ * partition set of E(Ω). Using Θ * relation, we can find the topological indices of any graph [31,40,[43][44][45]. For any i ∈ [k], the quotient Ω/F i graph in which vertex set belongs to the components of Ω − F i and x, y ∈ Ω/F i are adjacent in…”
Section: Topological Indicesmentioning
confidence: 99%