Abstract
AbstractThe distinguishing index of a graph is the least number of colors necessary to obtain an edge coloring of that is preserved only by the trivial automorphism. We show that if is a connected ‐regular graph for some infinite cardinal then , proving a conjecture of Lehner, Pilśniak, and Stawiski. We also show that if is a graph with infinite minimum degree and at most vertices of degree for every infinite cardinal , then . In particular, if has infinite minimum degree and order at most .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
