Strict neighbor-distinguishing total index of graphs

DOI10.1007/S10114-022-0593-9MaRDI QIDQ2131155zbMATH OpenOpenAlexFDO

Authors Jing Gu, Weifan Wang, Yiqiao Wang

Publication date 25 April 2022

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-022-0593-9

zbMATH Keywords

maximum degreestrict neighbor-distinguishing total indexstrict neighbor-distinguishing total-coloring

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Strict neighbor-distinguishing index of subcubic graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• A note on general neighbor-distinguishing total coloring of graphs.

Cites work

• A note on graphs of class I
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Concise proofs for adjacent vertex-distinguishing total colorings
• Every planar map is four colorable
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the AVDTC of 4-regular graphs
• On the Smarandachely adjacent vertex total coloring of some direct products
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• The adjacent vertex distinguishing total chromatic number
• The adjacent vertex distinguishing total coloring of planar graphs
• The bounds of the Smarandachely adjacent vertex total colorings of some kinds of 3-regular graphs
• The smarandachely adjacent vertex total coloring of a kind of 3-regular graphs.

Cited in

(4)

• Some bounds on the neighbor-distinguishing index of graphs
• General neighbour-distinguishing index of a graph
• Strict neighbor-distinguishing index of subcubic graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs

This page was built for publication: Strict neighbor-distinguishing total index of graphs

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