Show simple item record

AuthorJaradat, M.M.M.
Available date2023-11-09T05:37:20Z
Publication Date2010
Publication NameArs Combinatoria
ResourceScopus
ISSN3817032
URIhttp://hdl.handle.net/10576/49089
AbstractAn 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.
Languageen
PublisherCharles Babbage Research Centre
SubjectBasis number
Cycle basis
Cycle space
Lexicographic product
TitleA new upper bound of the basis number of the lexicographic product of graphs
TypeArticle
Pagination423-442
Volume Number97
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record