Choosing friends in everyday life by using graph theory

DOI10.61091/JCMCC119-12MaRDI QIDQ6580144zbMATH OpenFDO

Authors Abdul Aleem Mughal, Raja Noshad Jamil, Mohammad Reza Farahani, Mehdi Alaeiyan, M. Cancan

Publication date 29 July 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

wheel graphsface irregularity strengthP-labelling of plain graphsreal-life applications of wheel graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Graphs, friends and acquaintances
• scientific article; zbMATH DE number 1786489
• scientific article; zbMATH DE number 51019
• Graph theory, collaborative learning and communication
• scientific article; zbMATH DE number 7009326

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• Computing the irregularity strength of planar graphs
• Irregular total labellings of generalized Petersen graphs
• On edge irregularity strength of graphs
• On graph irregularity strength
• On the total vertex irregularity strength of trees
• Total edge irregularity strength of complete graphs and complete bipartite graphs

This page was built for publication: Choosing friends in everyday life by using graph theory

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