A5013070295- Finite Group Theory Research
- graph theory and CDMA systems
- Coding theory and cryptography
- Advanced Graph Theory Research
- Geometric and Algebraic Topology
- Limits and Structures in Graph Theory
- Graph theory and applications
- Rings, Modules, and Algebras
- Advanced Topics in Algebra
- Graph Labeling and Dimension Problems
- Homotopy and Cohomology in Algebraic Topology
- semigroups and automata theory
- Advanced Topology and Set Theory
- Algorithms and Data Compression
- Interconnection Networks and Systems
- Computational Geometry and Mesh Generation
- Advanced Numerical Analysis Techniques
- Advanced Differential Equations and Dynamical Systems
- Synthesis and Properties of Aromatic Compounds
- European Political History Analysis
- Mathematics and Applications
- Microtubule and mitosis dynamics
- Porphyrin and Phthalocyanine Chemistry
- Cooperative Communication and Network Coding
- Otitis Media and Relapsing Polychondritis
University of Primorska
2007-2024
University of Ljubljana
2013-2024
Institute of Mathematics, Physics, and Mechanics
1999-2022
University of the Basque Country
2013
Abstract A bicirculant is a graph admitting an automorphism with exactly two vertex‐orbits of equal size. All non‐isomorphic 4‐valent edge‐transitive bicirculants are characterized in this article. As corollary, characterization arc‐transitive dihedrants obtained. © 2011 Wiley Periodicals, Inc. J Graph Theory.
A graph X is said to be strongly distance-balanced whenever for any edge uv of and positive integer i , the number vertices at distance from u + 1 v equal . It proven that integers k ≥ 2 n 4 1, generalized Petersen GP( ) not distance-balanced.
In 1969, Lovász asked if every finite, connected vertex-transitive graph has a Hamilton path. spite of its easy formulation, no major breakthrough been achieved thus far, and the problem is now commonly accepted to be very hard. The same holds for special subclass Cayley graphs where existence cycles conjectured. 2007, Glover Marušič proved that cubic on finite (2, s, 3)-generated group G=〈 a, x| a2=xs=(ax)3=1, … 〉 path when |G| congruent 0 modulo 4, cycle 2 4. was constructed, combining...