The study of the b-choromatic number of some classes of fractal graphs

DOI10.1080/09720529.2022.2067390zbMath1496.05057OpenAlexW4283220400WikidataQ114847669 ScholiaQ114847669MaRDI QIDQ5043910

Muhammad Shoaib Sardar, Ziyattin Taş, Tayyiba Sattar, Murat Cancan, Moahmmad Reza Farahani, Mehdi Alaeiyan

Publication date: 6 October 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2022.2067390

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic numberhouse graphSierpinski graphSierpinski gasket network

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The b-chromatic number of cubic graphs
• On \(b\)-chromatic number of Sun let graph and wheel graph families
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• Some two-point resistances of the Sierpinski gasket network
• Some bounds for the \(b\)-chromatic number of a graph
• Graph fractal dimension and the structure of fractal networks
• On metric dimension of P(n, 2)ʘK₁ graph
• Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph
• b-Chromatic Number of <i>M</i>[<i>C<sub>n</sub></i>,<i>M</i>[<i>P<sub>n</sub></i>],<i>M</i>[<i>F<sub>1,n</sub></i>] and <i>M</i>[<i>W<sub>n</sub></i>]]
• Graph classes characterized both by forbidden subgraphs and degree sequences

This page was built for publication: The study of the b-choromatic number of some classes of fractal graphs