Results 21 to 30 of about 38,382 (189)
Classification of edge-transitive propeller graphs [PDF]
, 2015 In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by $Pr_{n}(b,c,d)$. We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such graphs are necessarily members of one of these four subfamilies, up to isomorphism.
Matthew C. Sterns
openalex +3 more sources
Triangles in the suborbital graphs of the normalizer of $\Gamma_0(N)$
Indonesian Journal of Combinatorics, 2020 In this paper, we investigate a suborbital graph for the normalizer of $\Gamma_0(N) in PSL(2;R)$, where N will be of the form 2^4p^2 such that p > 3 is a prime number.
Nazlı Yazıcı Gözütok +1 more
doaj +1 more source
On semi-transitive orientability of Kneser graphs and their complements [PDF]
, 2019 An orientation of a graph is semi-transitive if it is acyclic, and for any directed path $v_0\rightarrow v_1\rightarrow \cdots\rightarrow v_k$ either there is no edge between $v_0$ and $v_k$, or $v_i\rightarrow v_j$ is an edge for all $0\leq ...
Kitaev, Sergey, Saito, Akira
core +2 more sources
Hamiltonicity of 3-arc graphs [PDF]
, 2013 An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy ...
A. Gardiner +19 more
core +2 more sources
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
IEEE Access, 2020 Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +1 more source
A Novel and Efficient Method for Computing the Resistance Distance
IEEE Access, 2021 The resistance distance is an intrinsic metric on graphs that have been extensively studied by many physicists and mathematicians. The resistance distance between two vertices of a simple connected graph $G$ is equal to the resistance between two ...
Muhammad Shoaib Sardar +3 more
doaj +1 more source
On word-representability of polyomino triangulations [PDF]
, 2014 A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)$ is an edge in $E$. Some graphs are word-representable, others are not. It is known that a graph
Akrobotu, Prosper +2 more
core +2 more sources
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
Discussiones Mathematicae Graph Theory, 2021 Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal ...
Meng Wei
doaj +1 more source
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