Search the repository

 Query: search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing Work type: All work types Habilitation (m4) Specialist thesis (m3) High school thesis (m6) Bachelor work * (dip) Master disertations * (mag) Doctorate disertations * (dok) Research Data or Corpuses (data) * old and bolonia study programme Language: All languagesSlovenianEnglishGermanCroatianSerbianBosnianBulgarianCzechFinnishFrenchGerman (Austria)HungarianItalianJapaneseLithuanianNorwegianPolishRussianSerbian (cyrillic)SlovakSpanishSwedishTurkishUnknown Search in: RUP    FAMNIT - Faculty of Mathematics, Science and Information Technologies    FHŠ - Faculty of Humanities    FM - Faculty of Management    FTŠ Turistica - Turistica – College of Tourism Portorož    FVZ - Faculty of Health Sciences    IAM - Andrej Marušič Institute    PEF - Faculty of Education    UPR - University of PrimorskaCOBISS    Fakulteta za humanistične študije, Koper    Fakulteta za management Koper in Pedagoška fakulteta Koper    Fakulteta za vede o zdravju, Izola    Knjižnica za tehniko, medicino in naravoslovje, Koper    Turistica, Portorož    Znanstveno-raziskovalno središče Koper Options: Show only hits with full text Reset

 1 - 4 / 41 1.Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, original scientific articleAbstract: 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 besedahSummary 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 formPublished: 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 besedahSummary of found: ...perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's...Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished: 17.09.2018; Views: 413; Downloads: 6 Full text (0,00 KB) 3.Kromatsko število pandiagonalnih Latičnih kvadratnih grafovAnton Uramer, 2018, undergraduate thesisFound in: ključnih besedahSummary of found: ... graph coloring, Latin square graph, pandiagonal Latin square...Keywords: graph coloring, Latin square graph, pandiagonal Latin square graph, Cayley graph, hypergraphPublished: 17.09.2018; Views: 378; Downloads: 6 Full text (0,00 KB) 4.Fair packing of independent setsJoachim Schauer, Nevena Mitrović, Ulrich Pferschy, Martin Milanič, Matjaž Krnc, Nina Chiarelli, 2020, published scientific conference contributionFound in: ključnih besedahSummary of found: ...fair division, conflict graph, partial coloring...Keywords: fair division, conflict graph, partial coloringPublished: 03.06.2020; Views: 112; Downloads: 10 Full text (0,00 KB)This document has more files! More...
Search done in 0 sec.