Results 51 to 60 of about 1,592 (153)
Cubic edge-transitive graphs of order 2p3
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragan Marušič +2 more
openaire +1 more source
Edge-transitive graphs of small order and the answer to a 1967 question by Folkman [PDF]
, 2019 Marston Conder, Gabriel Verret
+6 more sources
Semi-hyper-connected edge transitive graphs
Discrete Mathematics, 2006 A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the concept of hyper-connected graphs to that of semi-hyper-connected graphs: a graph G is called semi-hyper-connected if the removal of every minimum cut of G ...
Jixiang Meng, Zhao Zhang
openaire +2 more sources
Cubic edge‐transitive graphs of order 10p2 [PDF]
AIP Conference Proceedings, 2010 A graph is called edge‐transitive, if its automorphisms group acts transitively on the set of its edges. In this paper, we prove every connected cubic edge‐transitive graph of order 10p2 is a symmetric graph, where p is a prime.
M. Alaeiyan, M. Lashani
openaire +2 more sources
ON THE CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER $58p2$ [PDF]
Journal of the Indonesian Mathematical Society, 2015 A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. In this paper, we inquire theexistence of connected edge-transitive cubic graphs of order 58p2foreach prime p. It is shown that only for p = 29, there exists a uniqueedge-transitive cubic graph of order 58p2.DOI : http://dx.doi.org/10.22342/jims.21.2.193.
Mehdi Alaeiyan, laleh pourmokhtar
openaire +2 more sources
Finite edge-transitive oriented graphs of valency four with cyclic normal quotients [PDF]
, 2022 Jehan A. Al-bar +3 more
openalex +1 more source
On optimal comparability editing with applications to molecular diagnostics
BMC Bioinformatics, 2009 Background The COMPARABILITY EDITING problem appears in the context of hierarchical disease classification based on noisy data. We are given a directed graph G representing hierarchical relationships between patient subgroups. The task is to identify the
Briesemeister Sebastian +2 more
doaj +1 more source
Temporal Ramsey Graphs: The Ramsey Kinematic Approach to the Motion of Systems of Material Points
DynamicsThe Ramsey approach is applied to analyses of the kinematics of systems built of non-relativistic, motile point masses/particles. This approach is based on colored graph theory. Point masses/particles serve as the vertices of the graph.
Edward Bormashenko
doaj +1 more source
Observations on graph invariants with the Lovász ϑ-function
AIMS MathematicsThis paper delves into three research directions, leveraging the Lovász $ \vartheta $-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses of strongly ...
Igal Sason
doaj +1 more source
A characterization of a family of edge-transitive metacirculant graphs
Journal of Combinatorial Theory, Series B, 2014 Abstract A characterization is given of the class of edge-transitive Cayley graphs of Frobenius groups Z r d : Z m with r an odd prime and m odd, of valency less than 2 p 1 with p 1 the smallest prime divisor of m .
Cai Heng Li +3 more
openaire +2 more sources