2018
DOI: 10.1080/10406638.2018.1544156
|View full text |Cite
|
Sign up to set email alerts
|

Topological Properties of Carbon Nanocones

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 54 publications
0
13
0
Order By: Relevance
“…It is worth mentioning that such a result was proved for Mostar index by only considering the vertex‐weight . In order to develop the technique for the bond‐additive TIs of strength‐weighted graphs, we shall also need the following elementary notations and results.Definition Let G sw = ( G , ( w v , s v ), s e ) be a strength‐weighted graph and { E 1 , …, E k } be a c‐partition of E ( G ) . Moreover, let Gsw/Ei=(),,G/Eiwvisvisei be the strength‐weighted quotient graph, where the functions wvi,0.5emsvi and sei are defined as follows: wvi:V()Gsw/Ei0+,0.5emwvi()X=xV()Xwv()x,XV()Gsw/Ei, svi:V()Gsw/Ei0+,0.5emsvi()X=fE()Xse()f0.5em+xV()Xsv()x,XV()Gsw/Ei, sei:E()Gsw/Ei0+,0.5emsei()F=f…”
Section: The Main Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…It is worth mentioning that such a result was proved for Mostar index by only considering the vertex‐weight . In order to develop the technique for the bond‐additive TIs of strength‐weighted graphs, we shall also need the following elementary notations and results.Definition Let G sw = ( G , ( w v , s v ), s e ) be a strength‐weighted graph and { E 1 , …, E k } be a c‐partition of E ( G ) . Moreover, let Gsw/Ei=(),,G/Eiwvisvisei be the strength‐weighted quotient graph, where the functions wvi,0.5emsvi and sei are defined as follows: wvi:V()Gsw/Ei0+,0.5emwvi()X=xV()Xwv()x,XV()Gsw/Ei, svi:V()Gsw/Ei0+,0.5emsvi()X=fE()Xse()f0.5em+xV()Xsv()x,XV()Gsw/Ei, sei:E()Gsw/Ei0+,0.5emsei()F=f…”
Section: The Main Resultsmentioning
confidence: 99%
“…The concept of a strength‐weighted graph was first implemented in reference as a triple G sw = ( G , SW V , SW E ) where G is a simple graph and SW V , SW E are respectively pairs of weighted functions defined on V ( G ) and E ( G ): SW V = ( w v , s v ), where wv,sv:V()Gitalicsw0+, SW E = ( w e , s e ), where we,se:E()Gitalicsw0+. …”
Section: Graph Theoretical Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations