On Density of Some Graphs and Their Mycielski Graph
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i3.5974Keywords:
density, density in graph, graph structureAbstract
Graph density offers an immediate measure of how tightly a network is connected. This paper gives explicit closed-form formulas for the densities of nine well-known undirected graph, simple, and connected graph families: barbell, friendship, sunlet, banana, lollipop, gear, tadpole, wheel, and fan graphs and their corresponding Mycielski graph. The result supply ready to use expressions that remove the need to build the graphs just to calculate its density. All proofs rely only on counting vertices and edges and substituting them into the definition of density.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Sango Racma, Isagani, Jr. Cabahug
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.