# 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 - 5 / 51 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: ...... Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic formPublished: 15.10.2013; Views: 1516; Downloads: 81 Full text (0,00 KB) 2.On graphs whose Laplacian index does not exceed 4.5JianFeng Wang, Qiongxiang Huang, Francesco Belardo, Enzo M. Li Marzi, 2013, original scientific articleFound in: ključnih besedahSummary of found: ...... Keywords: lastna vrednost, Laplacova matrika, grafi, eigenvalue, Laplacian matrix, graphsPublished: 15.10.2015; Views: 1416; Downloads: 92 Full text (0,00 KB) 3.Določeni razredi (hiper)grafov in njihove algebraične lastnostiPaweł Petecki, 2016, doctoral dissertationFound in: ključnih besedahSummary of found: ...Petersen graph, automorphism group, vertex-transitive, sign graph, L-eigenvalue, lollipop graph, ... Keywords: hypergraph, hamiltonian cycle, decomposition, double generalized Petersen graph, automorphism group, vertex-transitive, sign graph, L-eigenvalue, lollipop graphPublished: 09.08.2016; Views: 1464; Downloads: 3 Full text (0,00 KB) 4.Bifurkacije ravnovesnih stanj vektorskih polj in uporaba v sistemih plenilec-plenRade Nježić, 2018, undergraduate thesisFound in: ključnih besedahSummary of found: ...... Keywords: dynamical system, differential equation, equilibrium, local stability, bifurcation, eigenvalue, mathematical model, predator, preyPublished: 17.09.2018; Views: 267; Downloads: 3 Full text (0,00 KB) 5.On the non-existence of families of (d,k,delta)-digraphs containing only selfrepeat verticesSlobodan Filipovski, Robert Jajcay, 2019, original scientific articleFound in: ključnih besedahSummary of found: ...... Keywords: Moore digraph, selfrepeat vertex, eigenvalue, multiplicityPublished: 19.11.2018; Views: 329; Downloads: 55 Full text (0,00 KB)
Search done in 0 sec.