Št. zadetkov: 23
Izvirni znanstveni članek
Oznake:
permutation group;imprimitive group;dihedral group;Cayley graph;dihedrant;2-Arc-transitive graph;
A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of these graphs initiated by the third author in [D. Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003) 162-196]. The list consists ...
Leto:
2008
Vir:
Univerza na Primorskem (UP)
Objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)
Oznake:
Lovászov problem;Hamiltonski cikel;točkovno tranzitiven graf;Lovász problem;Hamilton cycle;vertex-transitive graph;
Lovász Hamiltonicity Problem
Leto:
2019
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
Hamiltonski cikel;točkovna tranzitivnost;grupa avtomorfizmov;Hamilton cycle;vertex-tranistive;automorphism group;
Leto:
2021
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
končno polje;polinom;kvadratni ostanek;finite field;polynomial;quadratic residues;
Polynomials of degree 4 over finite fields representing quadratic residues
Leto:
2019
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
točkovno tranzitiven graf;hamiltonski cikel;grupa avtomorfizmov;orbitalni graf;vertex-transitive graph;Hamilton cycle;automorphism group;orbital graph;
Članek prinaša napredek pri dolgo odprti Lovászevi domnevi o hamiltonskosti vozliščno tranzitivnih grafov. V članku je dokazano, da vsak povezan vozliščno tranzitiven graf, katerega red je produkt dveh praštevil, ki izhaja iz grupnega delovanja specialne projektivne linearne grupe PSL▫$(2, q^2)$▫ na ...
Leto:
2020
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
cube;classification;regular embedding;
Classification of regular embeddings of n-dimensional cubes
Leto:
2011
Vir:
Univerza na Primorskem (UP)
Video in druga učna gradiva
Oznake:
computer science;machine learning
Transfer learning techniques have witnessed a significant development in real applications where the knowledge from previous tasks are required to reduce the high cost of inquiring the labeled information for the target task. However, how to avoid negative transfer which happens due to different dis ...
Leto:
2011
Vir:
videolectures.net
Video in druga učna gradiva
Oznake:
computer science;data mining;databases
Synchronization is a powerful basic concept in nature regulating a large variety of complex processes ranging from the metabolism in the cell to social behavior in groups of individuals. Therefore, synchronization phenomena have been extensively studied and models robustly capturing the dynamical sy ...
Leto:
2010
Vir:
videolectures.net
Kratki znanstveni prispevek
Oznake:
matematika;teorija grafov;kromatično število;kartezični produkt;označevanje grafov;kvadrat grafa;mathematics;graph theory;chromatic number;Cartesian product;graph labeling;square if a graph;
The square ▫$G^2$▫ of a graph ▫$G$▫ is obtained from ▫$G$▫ by adding edges joining all pairs of nodes at distance 2 in ▫$G$▫. In this note we prove that ▫$\chi((C_m\Box C_n)^2) \le 6$ for $m, n \ge 40$▫. This confirms Conjecture 19 stated in [É. Sopena, J. Wu, Coloring the square of the Cartesian pr ...
Leto:
2013
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)
Izvirni znanstveni članek
Oznake:
matematika;teorija grafov;označitev točk;mathematics;graph theory;
An L(2,1)-labeling of a graph G = (V, E) is a function f from the vertex set V(G) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two and the labels on vertices at distance two differ by at least one. The span of f is the difference between the largest ...
Leto:
2014
Vir:
Fakulteta za naravoslovje in matematiko (UM FNM)