| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Trees with distinguishing index equal distinguishing number plus one
Authors:ID Alikhani, Saeid (Author)
ID Klavžar, Sandi (Author)
ID Lehner, Florian (Author)
ID Soltani, Samaneh (Author)
Files:.pdf Alikhani-2020-TREES_WITH_DISTINGUISHING_INDEX.pdf (144,96 KB)
MD5: 52B8E3DB245D84B546B3F5FD842D8D6A
 
URL https://doi.org/10.7151/dmgt.2162
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex (edge) labeling with d labels that is preserved only by the trivial automorphism. It is known that for every graph G we have D'(G) \leq D(G) + 1. In this note we characterize finite trees for which this inequality is sharp. We also show that if G is a connected unicyclic graph, then D'(G) = D(G).
Keywords:automorphism group, distinguishing index, distinguishing number, tree, unicyclic graph
Publication status:Published
Publication version:Version of Record
Submitted for review:15.09.2017
Article acceptance date:13.07.2018
Publisher:Technical University Press
Year of publishing:2020
Number of pages:Str. 875-884
Numbering:Letn. 40, št. 3
PID:20.500.12556/DKUM-92004 New window
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:18956889 New window
DOI:10.7151/dmgt.2162 New window
Publication date in DKUM:11.03.2025
Views:103
Downloads:25
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Funder:FWF - Austrian Science Fund
Funding programme:Erwin Schrödinger
Project number:J 3850
Name:Graphs and groups

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Title:Drevesa z razlikovalnim indeksom za ena večjim od razlikovalnega števila
Abstract:Razlikovalno število (indeks) D(G) (D'(G)) grafa G je najmanjše naravno število d, tako da G premore vozliščno (povezavno) označitev z d oznakami, ki jo ohranja le trivialni avtomorfizem. Znano je, da za vsak graf G velja D'(G) \leq D(G) + 1. V tem prispevku karakteriziramo končna drevesa, za katera je ta neenakost natančna. Dokažemo tudi, da če je G povezan, enociklični graf, potem velja D'(G) = D(G).
Keywords:grupa avtomorfizmov, razlikovalni indeks, razlikovalno število, drevo, enociklični graf


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica