Results 31 to 40 of about 38,382 (189)
Incremental $2$-Edge-Connectivity in Directed Graphs [PDF]
, 2016 In this paper, we initiate the study of the dynamic maintenance of $2$-edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$-edge-connected blocks of a directed graph with $n$ vertices through a sequence of ...
Georgiadis, Loukas +2 more
core +2 more sources
Super-connected edge transitive graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Meng, Jixiang
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
Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups [PDF]
ISRN Algebra, 2011 A Cayley graph of a finite group is called normal edge transitive if its automorphism group has a subgroup which both normalizes and acts transitively on edges. In this paper we determine all cubic, connected, and undirected edge-transitive Cayley graphs of dihedral groups, which are not normal edge transitive.
Mehdi Alaeiyan +2 more
openalex +3 more sources
Edge-transitive embeddings of complete graphs [PDF]
The Art of Discrete and Applied Mathematics, 2020 14 pages, 8 ...
openaire +5 more sources
Finite edge-transitive dihedrant graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pan, Jiangmin +3 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 +3 more sources
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.
Alaeiyan, Mehdi, Pourmokhtar, Laleh
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