Computing edge weights of symmetric classes of networks

DOI10.1155/2021/5562544MaRDI QIDQ6484159zbMATH OpenFDO

Authors Hafiz Usman Afzal, M. Javaid, Abdulaziz M. Alanazi, Maryam G. Alshehri

Publication date 24 January 2022

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/5562544

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Computing edge weights of magic labeling on rooted products of graphs
• Enumeration of the edge weights of symmetrically designed graphs
• On total labelings of graphs with prescribed weights
• Edge-antimagic graphs
• Generalized edge-magic total labellings of models from researching networks

Cited in

(2)

• Computing edge weights of magic labeling on rooted products of graphs
• scientific article; zbMATH DE number 7264203 (Why is no real title available?)

This page was built for publication: Computing edge weights of symmetric classes of networks

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