Computation of Wiener polynomial and index of line subdivision friendship and line subdivision bifriendship graphs using Matlab program

DOI10.22199/ISSN.0717-6279-5584MaRDI QIDQ6563253zbMATH OpenFDO

Authors Mahmoud Al-Rumaima, Abdu Alameri, Mohammed Alsharafi, Walid A. M. Saeed, Hanan Ahmed, Anwar Alwardi

Publication date 27 June 2024

Published in Proyecciones (Search for Journal in Brave)

zbMATH Keywords

line graphsubdivision graphWiener indexfriendship graphWiener polynomialbifriendship graph

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12)

Recommendations

• The Wiener polynomial for the subdivision graphs
• scientific article; zbMATH DE number 7690965
• Computing topological indices and polynomials for line graphs
• scientific article; zbMATH DE number 7540105
• VERTEX WEIGHTED WIENER POLYNOMIALS OF THE SUBDIVISION GRAPH AND THE LINE GRAPH OF SUBDIVISION GRAPH OF THE WHEEL GRAPH

Cites work

• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• On the Line-Graph of the Complete Bigraph
• Topological indices of the subdivision graph and the line graph of subdivision graph of the wheel graph

This page was built for publication: Computation of Wiener polynomial and index of line subdivision friendship and line subdivision bifriendship graphs using Matlab program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563253)