On the Basis Number of Some Special Graphs for Mycielski’s Graph | Zendy

Ghassan Marougi | Zendy; Raghad Mustafa | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Basis Number of Some Special Graphs for Mycielski’s Graph

Author(s) -

Ghassan Marougi,

Raghad Mustafa

Publication year - 2011

Publication title -

maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/al-rafidain journal for computer sciences and mathematics

Language(s) - English

Resource type - Journals

eISSN - 2311-7990

pISSN - 1815-4816

DOI - 10.33899/csmj.2011.163654

Subject(s) - combinatorics , basis (linear algebra) , graph , mathematics , cycle basis , discrete mathematics , line graph , graph power , geometry

105 On the Basis Number of Some Special Graphs for Mycielski’s Graph Raghad A. Mustafa Ghassan T. Marougi Raghad.Math@uomosul.edu.iq College of Computer Sciences and Mathematics University of Mosul, Iraq Accepted on: 16/05/2011Received on: 26/12/2010 ABSTRACT The basis number b(G) ,of a graph G is defined to be the least positive integer k such that G has a k-fold basis for it’s cycle space. In this research paper,we have studied the basis number of some special graphs for Mycielski’s graph .It is proved that

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research