Results 61 to 70 of about 1,592 (153)
SystemsRobust industry-university-research (I-U-R) collaborative networks are essential for accelerating innovation in the clean energy industry (CEI). This study employs the exponential random graph model to investigate how the network structural, node, and ...
Qiezeng Yuan, Heng Chen, Chang Liu
doaj +1 more source
Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
Journal of Graph Theory, 2022 AbstractA graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge‐length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius characterised exactly which vertex‐transitive graphs are globally rigid solely by their degree and maximal ...
openaire +4 more sources
An Analogue of Quasi-Transitivity for Edge-Coloured Graphs [PDF]
, 2022 Christopher Duffy, Todd Mullen
openalex +1 more source
Tetravalent edge-transitive graphs of girth at most 4
Journal of Combinatorial Theory, Series B, 2007 AbstractThis is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent graphs, undertaken recently by the authors. In this article, we study a special but important case in which the girth of such graphs is at most 4.
Steve Wilson, Primož Potočnik
openaire +2 more sources
On edge-primitive 3-arc-transitive graphs
, 2021 Michael Giudici, Carlisle S. H. King
openalex +2 more sources
On finite edge transitive graphs and rotary maps
Journal of Combinatorial Theory, Series B, 2008 It is shown that every connected vertex and edge transitive graph has a normal multicover that is a connected normal edge transitive Cayley graph. Moreover, every chiral or regular map has a normal cover that is a balanced chiral or regular Cayley map, respectively.
openaire +2 more sources
Uniform finite presentation for groups of polynomial growth
Discrete AnalysisUniform finite presentation for groups of polynomial growth, Discrete Analysis 2025:1, 29 pp. Let $G$ be a finitely generated infinite group with generators $a_1,\dots,a_k$. The _ball of radius_ $r$ in $G$ is defined to be the set of all elements of $G$
Philip Easo, Tom Hutchcroft
doaj +1 more source
Graphs on which a dihedral group acts edge-transitively
Discrete Mathematics, 1993 The author determines the graphs \(X\) such that \(\Aut(X)\) contains a subgroup \(D\) isomorphic to a dihedral group, and such that \(D\) acts edge- transitively on \(X\).
openaire +3 more sources
On super restricted edge-connectivity of edge-transitive graphs
Discrete Mathematics, 2010 Let X=(V,E) be a connected graph. Then X is called super restricted edge-connected, in short, [email protected]^', if every minimum edge set F of X such that X-F is disconnected and every component of X-F has at least two vertices, the set of edges being adjacent to a certain edge with minimum edge degree in X.
Jixiang Meng, Yingzhi Tian
openaire +2 more sources