Results 41 to 50 of about 1,592 (153)
Normal edge-transitive Cayley graphs of Frobenius groups [PDF]
Journal of Algebraic Combinatorics, 2015 A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the classification of normal edge-transitive Cayley graphs of order a product of two primes by dealing with Cayley graphs for ...
Brian P. Corr, Cheryl E. Praeger
openaire +3 more sources
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Electronic Journal of Graph Theory and Applications, 2015 An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G),$ is the minimum number of da-ecards that ...
P. Anusha Devi, S. Monikandan
doaj +1 more source
On edge transitivity of directed graphs
Discrete Mathematics, 1995 The author calls a graph \(G\) a local comparability graph if its edges can be given an acyclic orientation such that for each arc \(uv\), the subgraph induced by the nodes that are simultaneously ancestors of \(v\) and descendants of \(u\) is transitive. He then defines a parameter called the dimension of the graph and shows that a local comparability
openaire +3 more sources
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
Edge Transitive Dihedral Covers of The Heawood Graph [PDF]
Journal of the Indonesian Mathematical Society, 2018 A regular cover of a connected graph is called dihedral ifits transformation group is dihedral. In this paper, the authors clas-sify all dihedral coverings of the Heawood graph whose fibre-preservingautomorphism subgroups act edge-transitively.
Mehdi Alaeiyan, laleh pourmokhtar
openaire +2 more sources
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency [PDF]
, 2022 Marco Barbieri +2 more
openalex +3 more sources
Connectivity of vertex and edge transitive graphs
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On Cubic Graphs Admitting an Edge-Transitive Solvable Group [PDF]
Journal of Algebraic Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragan Marušič +2 more
openaire +2 more sources
Classification of edge‐transitive rose window graphs
Journal of Graph Theory, 2010 AbstractGiven natural numbers n⩾3 and 1⩽a, r⩽n−1, the rose window graph Rn(a, r) is a quartic graph with vertex set \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}$\{{{x}}_{{i}}|{{i}}\in {\mathbb{Z}}_{{n}}\} \cup \{{{y}}_{{i}}|{{i}}\in{\mathbb{Z}}_{{n}}\}$\end ...
Kovács, István +2 more
openaire +2 more sources