2021
DOI: 10.1007/s10910-020-01194-3
|View full text |Cite
|
Sign up to set email alerts
|

Biochemical and phylogenetic networks-I: hypertrees and corona products

Abstract: We have obtained graph-theoretically based topological indices for the characterization of certain graph theoretical networks of biochemical interest. We have derived certain distance, degree and eccentricity based topological indices for various k -level hypertrees and corona product of hypertrees. We have also pointed out errors in a previous study. The validity of our results is supported by computer codes for the respective indices. Several biochemical applications are pointed out.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…e vertices of CBT(t) are designated in the following way: the label of root node is 1 and it is at level 0. For any vertex l, the children of l are tagged with 2l and 2l + 1 [28]. In a hypertree, extra edges are horizontal, where in the same level k, 1 ≤ k ≤ t, any two vertices are attached by an edge (see Figure 1).…”
Section: Structure Of Complete Hypertreementioning
confidence: 99%
See 4 more Smart Citations
“…e vertices of CBT(t) are designated in the following way: the label of root node is 1 and it is at level 0. For any vertex l, the children of l are tagged with 2l and 2l + 1 [28]. In a hypertree, extra edges are horizontal, where in the same level k, 1 ≤ k ≤ t, any two vertices are attached by an edge (see Figure 1).…”
Section: Structure Of Complete Hypertreementioning
confidence: 99%
“…In a hypertree, extra edges are horizontal, where in the same level k, 1 ≤ k ≤ t, any two vertices are attached by an edge (see Figure 1). Consider the hypertree CBT(3) in Figure 1 (see [28]) as an illustration to deduce distinct topological indices and their respective entropies. To demonstrate our main findings, we form a partition of edges of the hypertree CBT(t) for t levels established on eccentricity of end vertices in Tables 3 and 4 representing the edge partition of CBT(t).…”
Section: Structure Of Complete Hypertreementioning
confidence: 99%
See 3 more Smart Citations