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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.