The Basis Number of Mycielski ’s Graph for Some Cog- Graphs
Keywords:Basis number , k-fold , Mycielski’s graph
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.
How to Cite
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 journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.