On EAZ index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges

Das, Kinkar Chandra; Mondal, Sourav

doi:10.1007/s12190-024-02086-4

J. Appl. Math. Comput.

2024

DOI: 10.1007/s12190-024-02086-4

|View full text |Cite

On EAZ index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges

Kinkar Chandra Das,

Sourav Mondal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

Das,

Mondal,

Huh

2024

Comp. Appl. Math.

View full text Add to dashboard Cite

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

Das,

Mondal,

Huh

2024

Comp. Appl. Math.

View full text Add to dashboard Cite

Complete solution to open problems on exponential augmented Zagreb index of chemical trees

Mondal,

Das

2024

Applied Mathematics and Computation

View full text Add to dashboard Cite

The Minimal Molecular Tree for the Exponential Randić Index

Bera,

Das

2024

Mathematics

View full text Add to dashboard Cite

Topological indices are numerical parameters that provide a way to quantify the structural features of molecules using their graph representations. In chemical graph theory, these indices have been effectively employed to predict various physico-chemical properties of molecules. Among these, the Randić index stands out as a classical and widely used molecular descriptor in chemistry and pharmacology. The Randić index R(G) for a given graph G is defined as R(G)=∑vivj∈E(G)1d(vi)d(vj), where d(vi) represents the degree of vertex vi and E(G) is the set of edges in the graph G. Given the Randić index’s strong discrimination ability in describing molecular structures, a variant known as the exponential Randić index was recently introduced. The exponential Randić index ER(G) for a graph G is defined as ER(G)=∑vivj∈E(G)e1d(vi)d(vj). This paper further explores and fully characterizes the minimal molecular trees in relation to the exponential Randić index. Moreover, the chemical relevance of the exponential Randić index is also investigated.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

On EAZ index of unicyclic and bicyclic graphs, general graphs in terms of the number of cut edges

Cited by 3 publications

References 17 publications

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

Complete solution to open problems on exponential augmented Zagreb index of chemical trees

The Minimal Molecular Tree for the Exponential Randić Index

Contact Info

Product

Resources

About