On the local distinguishing numbers of cycles

DOI10.1016/S0012-365X(98)00167-8zbMATH Open0932.05042OpenAlexW1972858392MaRDI QIDQ1297401FDOQ1297401

V. Pereyra

Publication date: 27 February 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00167-8

Recommendations

• Publication:4489139
• On the local distinguishing chromatic number
• The distinguishing chromatic number of line graphs of complete graphs
• Distinguishability of locally finite trees

zbMATH Keywords

labeled graphdistinguishing numberdistinguishing labeling

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Symmetry breaking in graphs
• The Diameter of Random Graphs
• Title not available (Why is that?)
• Random Graph Isomorphism
• Title not available (Why is that?)
• m-ary closed sequences

Cited In (8)

• Counting odd cycles in locally dense graphs
• Distinguishing labeling of group actions
• Title not available (Why is that?)
• Local Ramsey numbers for copies of cycles
• Effective localization number: Building k-surviving degrees
• The distinguishing number of Cartesian products of complete graphs
• On the local distinguishing chromatic number
• The distinguishing number of the hypercube

This page was built for publication: On the local distinguishing numbers of cycles

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