A new upper bound of the basis number of the lexicographic product of graphs
| Author | Jaradat, M.M.M. |
| Available date | 2023-11-09T05:37:20Z |
| Publication Date | 2010 |
| Publication Name | Ars Combinatoria |
| Resource | Scopus |
| ISSN | 3817032 |
| Abstract | An upper bound of the basis number of the lexicographic product of two graphs from the basis number of the factors is presented. Furthermore, the basis numbers of the lexicographic product of some classes of graphs is determined. |
| Language | en |
| Publisher | Charles Babbage Research Centre |
| Subject | Basis number Cycle basis Cycle space Lexicographic product |
| Type | Article |
| Pagination | 423-442 |
| Volume Number | 97 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
This item appears in the following Collection(s)
-
Materials Science & Technology [345 items ]