Chromatic Zagreb and irregularity polynomials of graphs
From MaRDI portal
Publication:5025134
DOI10.1142/S1793830921500610zbMath1478.05042OpenAlexW3108109490MaRDI QIDQ5025134
Publication date: 1 February 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500610
graph coloringchromatic irregularity polynomialschromatic Zagreb polynomialsminimal parameter coloring
Graph polynomials (05C31) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Methods of destroying the symmetries of a graph
- Several parameters of generalized Mycielskians
- On chromatic Zagreb indices of certain graphs
- Graph Classes: A Survey
- Graph Colorings
- Generalised colouring sums of graphs
- On Certain Types of Product Set-Labeling of Graphs
This page was built for publication: Chromatic Zagreb and irregularity polynomials of graphs