Distant total sum distinguishing index of graphs
From MaRDI portal
Publication:1712511
DOI10.1016/J.DISC.2018.10.039zbMath1403.05051arXiv1703.05672OpenAlexW2607245078WikidataQ128866935 ScholiaQ128866935MaRDI QIDQ1712511
Publication date: 22 January 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05672
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing index
- Distant irregularity strength of graphs
- Neighbor sum distinguishing total colorings of planar graphs
- On irregular total labellings
- Irregularity strength of regular graphs
- A new upper bound for the total vertex irregularity strength of graphs
- Adjacent strong edge coloring of graphs
- Distant total irregularity strength of graphs via random vertex ordering
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Edge weights and vertex colours
- On the total-neighbor-distinguishing index by sums
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs
- A survey on the distance-colouring of graphs
- Vertex colouring edge partitions
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Irregular Assignments of Trees and Forests
- Vertex-distinguishing proper edge-colorings
- 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
- Total Vertex Irregularity Strength of Dense Graphs
- Irregularity strength of dense graphs
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
This page was built for publication: Distant total sum distinguishing index of graphs
