The Basis Number of Mycielski ’s Graph for Some Cog- Graphs

Authors

  • Barah M. Sulaiman
  • Rasha S. Hasan
  • Raghad Mustafa University of Mosul

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i2.4704

Keywords:

Basis number , k-fold , Mycielski’s graph

Abstract

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

2023-04-30

How to Cite

Sulaiman, B. M., Hasan, R. S., & Mustafa, R. (2023). The Basis Number of Mycielski ’s Graph for Some Cog- Graphs. European Journal of Pure and Applied Mathematics, 16(2), 953–964. https://doi.org/10.29020/nybg.ejpam.v16i2.4704

Issue

Vol. 16 No. 2: (April 2023)

Section

Nonlinear Analysis

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

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.