Lupa

Show document Help

A- | A+ | Print
Title:Paint cost spectrum of perfect k-ary trees
Authors:ID Mafunda, Sonwabile (Author)
ID Merzel, Jonathan L. (Author)
ID Perry, Katherine E. (Author)
ID Varvak, Anna (Author)
Files:.pdf ADAM_Mafunda,_Merzel,_Perry,_Varvak_2026.pdf (441,47 KB)
MD5: 5FB550B3DD42B36BAB2994584F675E34
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:We determine the paint cost spectrum for perfect k-ary trees. A coloring of the vertices of a graph G with d colors is said to be d-distinguishing if only the trivial automorphism preserves the color classes. The smallest such d is the distinguishing number of G and is denoted Dist(G). The paint cost of d-distinguishing G, denoted ρd(G), is the minimum size of the complement of a color class over all d-distinguishing colorings. A subset S of the vertices of G is said to be a fixing set for G if the only automorphsim that fixes the vertices in S pointwise is the trivial automorphism. The cardinality of a smallest fixing set is denoted Fix(G). In this paper, we explore the breaking of symmetry in perfect k-ary trees by investigating what we define as the paint cost spectrum of a graph G: (Dist(G); ρDist(G)(G), ρDist(G)+1(G), . . . , ρFix(G)+1(G)) and the paint cost ratio of G, which is defined to be the fraction of paint costs in the paint cost spectrum equal to Fix(G). We determine both the paint cost spectrum and the paint cost ratio completely for perfect k-ary trees. We also prove a lemma that is of interest in its own right: given an n-tuple, n ≥ 2 of distinct elements of an ordered abelian group and 1 ≤ k ≤ n! − 1, there exists a k × n row permuted matrix with distinct column sums.
Keywords:distinguishing coloring, fixing set, symmetry, cost of distinguishing
Publication status:Published
Publication version:Version of Record
Publication date:28.01.2026
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:17 str.
Numbering:Vol. 9, no. 2, [article no.] P2.01
PID:20.500.12556/RUP-22837 This link opens in a new window
UDC:51
eISSN:2590-9770
DOI:10.26493/2590-9770.1847.2ad This link opens in a new window
Publication date in RUP:23.03.2026
Views:216
Downloads:5
Metadata:XML DC-XML DC-RDF
:
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:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Spekter stroškov barvanja popolnih k-arnih dreves
Abstract:Določimo spekter stroškov barvanja za popolna k-arna drevesa. Barvanje vozlišč grafa G z d barvami imenujemo d-razlikovalno, če razrede barv ohranjale trivialni avtomorfizem. Najmanjše takšno številodje razlikovalno število grafa G in ga označimo z Dist(G).Strošek barvanja za d-razlikovanje grafa G, označen z ρd(G), je najmanjša velikost komplementa barvnega razreda med vsemi d-razlikovalnimi barvanji. Pod množico S vozlišč grafa G imenujemo fiksirna množica za G, če je edini avtomorfizem, ki točkovno fiksira vsa vozlišča v S, trivialni avtomorfizem. Kardinalnost najmanjše fiksirne množice označimo s Fix(G). V tem članku raziskujemo razbijanje simetrije v popolnih k-arnih drevesih tako, da preučujemo tisto, kar definiramo kot spekter stroškov barvanja grafa G: (Dist(G); ρDist(G)(G), ρDist(G)+1(G), . . . , ρFix(G)+1(G)) in razmerje stroška barvanja grafa G, ki ga definiramo kot delež stroškov barvanja v spektru stroškov barvanja, ki so enaki Fix(G). Za popolna k-arna drevesa v celoti določimo tako spekter stroškov barvanja kot tudi razmerje stroška barvanja. Dokažemo tudi lemo, ki je zanimiva sama po sebi: za dan n-terec, n≥2, različnih elementov urejene abelove grupe in za 1≤k≤n!−1 obstaja k × n matrika, dobljena spermutacijami vrstic, z različnimi vsotami stolpcev.
Keywords:razlikovalno barvanje, fiksirna množica, simetrija, strošek razločevanja


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