Choosing friends in everyday life by using graph theory
From MaRDI portal
Publication:6580144
DOI10.61091/JCMCC119-12zbMATH Open1544.05107MaRDI QIDQ6580144FDOQ6580144
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)
Recommendations
wheel graphsface irregularity strengthP-labelling of plain graphsreal-life applications of wheel graphs
Cites Work
- Title not available (Why is that?)
- On graph irregularity strength
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- On edge irregularity strength of graphs
- Irregular total labellings of generalized Petersen graphs
- On the total vertex irregularity strength of trees
- Computing the irregularity strength of planar 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)