Distant irregularity strength of graphs

DOI10.1016/J.DISC.2013.08.031zbMATH Open1281.05058OpenAlexW2067612866MaRDI QIDQ394284FDOQ394284

Authors: Jakub Przybyło 

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.031

Recommendations

• 1-distant irregularity strength of graphs
• Distant irregularity strength of graphs with bounded minimum degree
• Irregularity strength of dense graphs
• Irregularity strength of dense graphs
• On graph irregularity strength
• scientific article; zbMATH DE number 4139798
• Irregularity strength of regular graphs
• Distant total irregularity strength of graphs via random vertex ordering
• Distance irregularity strength of graphs with pendant vertices
• Irregularity strength of regular graphs of large degree

zbMATH Keywords

irregularity strengthtotal vertex irregularity strength\(1,2,3\)-conjecture\(1,2\)-conjecturedistant irregularity strengthirregular colouring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A new upper bound for the total vertex irregularity strength of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• On a \(1,2\) conjecture
• Title not available (Why is that?)
• On graph irregularity strength
• Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
• Irregularity strength of dense graphs
• On irregular total labellings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Moore graphs and beyond: a survey of the degree/diameter problem
• A Tight Bound on the Irregularity Strength of Graphs
• Irregularity strength of regular graphs
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• A new upper bound for the irregularity strength of graphs
• Irregular Assignments of Trees and Forests
• A survey on the distance-colouring of graphs
• The diameter of random regular graphs
• The irregularity strength of \(K_{m,m}\) is 4 for odd m
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• Title not available (Why is that?)

Cited In (17)

• Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
• On the neighbor sum distinguishing index of planar graphs
• Non-proper edge-colouring of graphs and hereditary graph properties
• A notion of vertex equitability for proper labellings
• Distant sum distinguishing index of graphs
• Distant sum distinguishing index of graphs with bounded minimum degree
• 1-distant irregularity strength of graphs
• Distant total irregularity strength of graphs via random vertex ordering
• Distant set distinguishing edge colourings of graphs
• Distant irregularity strength of graphs with bounded minimum degree
• Total vertex irregularity strength of dense graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• On the hardness of determining the irregularity strength of graphs
• Title not available (Why is that?)
• Distant total sum distinguishing index of graphs
• Going wide with the 1-2-3 conjecture
• Distant set distinguishing total colourings of graphs

This page was built for publication: Distant irregularity strength of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394284)