Related papers: Cubic factor-invariant graphs of bialternating cyc…
In this paper, we show that for a graph $\Gamma$ from a class named H-rigid graphs, its subgraph ${\rm Int}(\Gamma)$, named the internal graph of $\Gamma$, is an isomorphism invariant of the graph product of hyperfinite II$_1$-factors…
A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…
In [1, 2, 3] the Corolla Polynomial $ \mathcal C (\Gamma) \in \mathbb C [a_{h_1}, \ldots, a_{h_{\left \vert \Gamma^{[1/2]} \right \vert}}] $ was introduced as a graph polynomial in half-edge variables $ \left \{ a_h \right \} _{h \in…
Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…
We give necessary and sufficient conditions on the parameters of a regular graph $\Gamma$ (with or without loops) such that $E(\Gamma)=E(\overline \Gamma)$. We study complementary equienergetic cubic graphs obtaining classifications up to…
A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…
With recent breakthroughs in the construction of good qLDPC codes and nearly good qLTCs, the study of (co)homological invariants of quantum code complexes, which fundamentally underlie their logical operations, has become evidently…
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…
A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we…
It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…
It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…
We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect…
Given a finitely-generated group G, and a finite group \Gamma, Philip Hall defined \delta_\Gamma to be the number of factor groups of G that are isomorphic to \Gamma. We show how to compute the Hall invariants by cohomological and…
For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…
We show that there exists an infinite family of cubic $2$-connected non-hamiltonian graphs with girth $5$ containing a unique longest cycle.
We consider the invariants Ker and Im for commutative squares in quasi-abelian categories. These invariants were introduced by Lambek for groups and then studied by Hilton and Nomura in exact categories.
We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…