Equitable cluster partition of graphs with small maximum average degree

Xiaoling Liu; Lei Sun; Wei Zheng

doi:10.7151/dmgt.2564

ScienceGate Book Chapters

JOURNAL ARTICLE

Equitable cluster partition of graphs with small maximum average degree

Xiaoling Liu Lei Sun Wei Zheng

Year: 2024 Journal: Discussiones Mathematicae Graph Theory Vol: 45 (3)Pages: 995-995 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.2564

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Partition (number theory) Combinatorics Degree (music) Frequency partition of a graph Cluster (spacecraft) Discrete mathematics Graph Computer science Line graph Graph power Physics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.22

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Equitable cluster partition of graphs with small maximum average degree

Metrics

Topics

Related Documents

Equitable coloring and equitable choosability of graphs with small maximum average degree

Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

Partition of graphs with maximum degree ratio

List 3-dynamic coloring of graphs with small maximum average degree

Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree