How to Define an Irregular Graph

DOI10.2307/2686701zbMath0995.05516OpenAlexW4233617430WikidataQ105687222 ScholiaQ105687222MaRDI QIDQ3150560

Ortrud R. Oellermann, Gary Chartrand

Publication date: 17 October 2002

Full work available at URL: https://doi.org/10.2307/2686701

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (42)

On Proper Labellings of Graphs with Minimum Label Sum ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ Unnamed Item ⋮ Graphs with maximum irregularity ⋮ Unnamed Item ⋮ On the maximum size of stepwise irregular graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ New results on imbalance graphic graphs ⋮ Distant set distinguishing edge colourings of graphs ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs ⋮ On \(ve\)-degree and \(ev\)-degree of graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ Unnamed Item ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ REGULAR EXTENSION OF GRAPHS ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ The irregularity of graphs under graph operations ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Graph irregularity and its measures ⋮ Distant sum distinguishing index of graphs ⋮ The irregularity polynomials of Fibonacci and Lucas cubes ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Stepwise irregular graphs ⋮ A comparison study of irregularity descriptors of benzene ring embedded in P-type surface network and its derived network ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Graphs with maximal \(\sigma\) irregularity ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ EXTREMAL IRREGULARITY OF TOTALLY SEGREGATED UNICYCLIC GRAPHS ⋮ NONREGULAR GRAPHS WITH MINIMAL TOTAL IRREGULARITY ⋮ Highly Irregular ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Total i̇rregulari̇ty of fractal graphs ⋮ On proper labellings of graphs with minimum label sum

This page was built for publication: How to Define an Irregular Graph