Distant total irregularity strength of graphs via random vertex ordering
From MaRDI portal
Publication:1699557
DOI10.1016/j.disc.2017.10.028zbMath1380.05080arXiv1703.00376OpenAlexW2594263019MaRDI QIDQ1699557
Publication date: 23 February 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.00376
1-2 conjecture\(r\)-distant total irregularity strength of a graphtotal vertex irregularity strength of a graph
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (2)
Distant irregularity strength of graphs with bounded minimum degree ⋮ Distant total sum distinguishing index of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distant irregularity strength of graphs
- Every graph is \((2,3)\)-choosable
- On the total vertex irregularity strength of trees
- On irregular total labellings
- Irregularity strength of regular graphs
- A new upper bound for the total vertex irregularity strength of graphs
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Distant irregularity strength of graphs with bounded minimum degree
- A survey on the distance-colouring of graphs
- Total irregularity strength of three families of graphs
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Irregular Assignments of Trees and Forests
- On the irregularity strength of them ×n grid
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Total Vertex Irregularity Strength of Dense Graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Irregularity strength of dense graphs
This page was built for publication: Distant total irregularity strength of graphs via random vertex ordering
