Details

Karakterizacije kografov in algoritma za izračun varnostne dominacije na kografih : magistrsko delo
ID Kišek, Anja (Author), ID Klavžar, Sandi (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (857,80 KB)
MD5: 9C0A26277E0A10E284D8F7A7E8622013

Abstract
V delu obravnavamo kografe, njihovo reprezentacijo s kodrevesi in karakterizacijo kografov. Uvrstimo jih v družino popolnih grafov in raziščemo problem barvanja kografov. Poleg algoritma za barvanje navedemo nekaj algoritmov, ki zaradi strukture kodrevesa delujejo v linearnem času, med njimi dominacijo in varnostno dominacijo. Slednjo definiramo in raziščemo njene lastnosti. Obravnavamo dva neodvisna algoritma za iskanje varnostnodominantnega števila na kografih in argumentiramo njuno linearnost.

Language:Slovenian
Keywords:kograf, kodrevo, varnostnodominantno število, dominantno število, popoln graf, linearen algoritem
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FMF - Faculty of Mathematics and Physics
Year:2021
PID:20.500.12556/RUL-126403 This link opens in a new window
UDC:519.1
COBISS.SI-ID:60413955 This link opens in a new window
Publication date in RUL:21.04.2021
Views:1309
Downloads:173
Metadata:XML DC-XML DC-RDF
:
KIŠEK, Anja, 2021, Karakterizacije kografov in algoritma za izračun varnostne dominacije na kografih : magistrsko delo [online]. Master’s thesis. [Accessed 14 April 2025]. Retrieved from: https://repozitorij.uni-lj.si/IzpisGradiva.php?lang=eng&id=126403
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Characterisation of cographs and two algorithms for computation of secure domination number of a cograph
Abstract:
This work studies cographs, their representation with cotrees and their different characterisations. By observing their colorings, cographs are proved to be a special case of perfect graphs. In addition, a few linear algorithms that exploit the structure of cotrees are presented. Security domination of a graph is introduced and some properties, crucial for its computation are presented. Two independent algorithms for security domination number of cographs are studied and their linearity is argumented.

Keywords:cograph, cotree, security domination number, domination number, perfect graph, linear algorithm

Similar documents

Similar works from RUL:
  1. Časovno odvisni tok skozi kvantno piko v prisotnosti napetostne sonde
  2. Symmetry classification of many-body Lindbladians: tenfold way and beyond
  3. Lindbladian dissipation of strongly-correlated quantum matter
  4. Nonequilibrium properties of Mott insulators
  5. Effect of doping on a quantum spin liquid 1T-TaS$_2$
Similar works from other Slovenian collections:
  1. Towards ultrafast X-ray condensed matter physics with MHz repetition rate HHG sources
  2. The dissociation constant of water at extreme conditions
  3. Conductive atomic force microscopy investigations of quantum dots and quantum rings

Back