1. Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, original scientific article Abstract: It is shown that the graph ▫$\Gamma_n$▫ that has the set of all ▫$n \times n$▫ symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if ▫$n \ge 3$▫. Eigenvalues of the graph ▫$\Gamma_n$▫ are calculated as well. Found in: ključnih besedah Summary of found: ...It is shown that the graph ▫$\Gamma_n$▫ that has the set of all... ...matrix, finite field, eigenvalue of a graph, coloring, quadratic form... Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form Published: 15.10.2013; Views: 1702; Downloads: 88 Full text (0,00 KB) 
2. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Found in: ključnih besedah Summary of found: ...perfect phylogeny, NPhard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's... Keywords: perfect phylogeny, NPhard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, minmax theorem, approximation algorithm, heuristic Published: 17.09.2018; Views: 413; Downloads: 6 Full text (0,00 KB) 
3. 
4. Fair packing of independent setsJoachim Schauer, Nevena Mitrović, Ulrich Pferschy, Martin Milanič, Matjaž Krnc, Nina Chiarelli, 2020, published scientific conference contribution Found in: ključnih besedah Summary of found: ...fair division, conflict graph, partial coloring... Keywords: fair division, conflict graph, partial coloring Published: 03.06.2020; Views: 112; Downloads: 10 Full text (0,00 KB) This document has more files! More...
