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

DOI10.22199/ISSN.0717-6279-5584zbMATH Open1540.05035MaRDI QIDQ6563253

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

Publication date: 27 June 2024

Published in: Proyecciones (Search for Journal in Brave)

zbMATH Keywords

line graphWiener indexsubdivision graphfriendship graphWiener polynomialbifriendship graph

Mathematics Subject Classification ID

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

Cites Work

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

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)