The Basis Number of Mycielski ’s Graph for Some Cog- Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i2.4704Keywords:
Basis number , k-fold , Mycielski’s graphAbstract
Let G = (V, E) be a simple connected graph, then the basis number of G is denoted by b(G) and is defined by the least positive integer k such that the graph G has a k − fold basis for it is cycle space. In this paper we studied the basis number of Mycielski’s graph for some cog-special graphs, and we compute the basis number of Mycielski’s graph for cog-path graph, cog-cycle graph, cog-star graph, and cog-wheel graph.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 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.