Results 31 to 40 of about 1,592 (153)
Cubic semisymmetric graphs of order $ 40p $ [PDF]
ریاضی و جامعهA simple graph $\Gamma$ is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. A simple graph $\Gamma$ is called cubic whenever it is $ 3 $-regular.
Mohammad Reza Salarian +1 more
doaj +1 more source
Recipes for edge-transitive tetravalent graphs
The Art of Discrete and Applied Mathematics, 2020 This paper presents all constructions known to the authors which result in tetravalent graphs whose symmetry groups are large enough to be transitive on the edges of the graph.
Primož Potočnik, Stephen E. Wilson
openaire +2 more sources
A family of edge-transitive Cayley graphs [PDF]
Journal of Algebraic Combinatorics, 2018 Edge-transitive graphs of order a prime or a product of two distinct primes with any positive integer valency, and of square-free order with valency at most 7 have been classified by a series of papers. In this paper, a complete classification is given of edge-transitive Cayley graphs of square-free order with valency less than the smallest prime ...
Jiangmin Pan, Zhaofei Peng
openaire +2 more sources
Characterization of perfect matching transitive graphs
Electronic Journal of Graph Theory and Applications, 2018 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj +1 more source
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati +3 more
doaj +1 more source
Super-connected edge transitive graphs
Discrete Applied Mathematics, 2008 AbstractA graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a previous work due to the second author of this note, super-connected graphs which are both vertex transitive and edge transitive are characterized. In this note, we generalize the characterization to edge transitive graphs which are not necessarily vertex ...
Jixiang Meng, Zhao Zhang
openaire +2 more sources
The step Sidorenko property and non-norming edge-transitive graphs [PDF]
Journal of Combinatorial Theory, Series A, 2018 Comment: Minor correction on page ...
Daniel Král͏̌ +3 more
openalex +5 more sources
Finite edge-transitive dihedrant graphs
Discrete Mathematics, 2012 AbstractIn this paper, we first prove that each biquasiprimitive permutation group containing a regular dihedral subgroup is biprimitive, and then give a classification of such groups. The classification is then used to classify vertex-quasiprimitive and vertex-biquasiprimitive edge-transitive dihedrants.
Hua Zhang +3 more
openaire +2 more sources
IEEE Access, 2018 Blockchain can potentially be deployed in a wide range of applications due to its capability to ensure decentralization, transparency, and immutability. In this paper, we design a cryptographic membership authentication scheme (i.e., authenticating graph
Chao Lin +4 more
doaj +1 more source
On edge-transitive Cayley graphs of valency four
European Journal of Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cai Heng Li, Ming Yao Xu, Xin Gui Fang
openaire +2 more sources