| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:On the b-chromatic number of rooted product graphs
Authors:ID Bockting-Conrad, Sarah (Author)
ID Jakovac, Marko (Author)
ID Lang, Michael S. (Author)
Files:.pdf RAZ_Bockting-Conrad_Sarah_2025.pdf (212,89 KB)
MD5: 996D87F1883EEA0907A8817A4D3C4D35
 
URL https://www.pmf.ni.ac.rs/filomat-content/2025/39-11/39-11-22-26330.pdf
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:The b-chromatic number of a graph G was defined by Irving and Manlove in 1999 as the largest integer k for which G admits a proper coloring with k colors such that every color class (in this proper coloring) has a vertex that is adjacent to at least one vertex in every other color class. The b-chromatic number has been studied in many contexts, including for various graph products. The rooted product, defined by Godsil and McKay in 1978, is not yet among these. We find bounds for the b-chromatic number of the rooted product of two graphs in terms of the b-chromatic numbers and degrees of the factors, along with some new parameters that we define. Moreover, we give sufficient conditions for equality to hold in these bounds. We refine our results, sometimes to exact values, when one or both of the factors is a path, cycle, complete graph, star, or wheel.
Keywords:graph theory, chromatic number, b-chromatic number
Publication status:Published
Publication version:Version of Record
Submitted for review:01.12.2024
Article acceptance date:26.01.2025
Year of publishing:2025
Number of pages:str. 3805-3815
Numbering:Letn. 39, št. 11
PID:20.500.12556/DKUM-93806 New window
UDC:519.17
ISSN on article:0354-5180
COBISS.SI-ID:232792067 New window
DOI:10.2298/FIL2511805B New window
Publication date in DKUM:22.07.2025
Views:244
Downloads:15
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Filomat
Shortened title:Filomat
Publisher:Filozofski fakultet
ISSN:0354-5180
COBISS.SI-ID:1024191828 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297-2022
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285-2023
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3002-2021
Name:Prirejanja in barvanja povezav v kubičnih grafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008-2022
Name:Drevesno neodvisnostno število grafov

Secondary language

Language:Slovenian
Keywords:teorija grafov, kromatično število, b-kromatično število


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica