Equitable cluster partition of graphs with small maximum average degree
Saved in:
| Main Authors: | Xiaoling Liu, Lei Sun, Wei Zheng |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2025-01-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Online Access: | https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2564 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers
by: Patcharapan Jumnongnit, et al.
Published: (2017-01-01) -
On the Spectral Radius of the Maximum Degree Matrix of Graphs
by: Eber Lenes, et al.
Published: (2025-05-01) -
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
by: Gaixiang Cai, et al.
Published: (2021-01-01) -
Equitable choosability of prism graphs
by: Kirsten Hogenson, et al.
Published: (2025-01-01) -
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree
by: Fei Wen, et al.
Published: (2025-01-01)