Results 51 to 60 of about 18,773 (121)

On Hamilton decompositions of infinite circulant graphs

Journal of Graph Theory, Volume 88, Issue 3, Page 434-448, July 2018., 2018
Abstract The natural infinite analog of a (finite) Hamilton cycle is a two‐way‐infinite Hamilton path (connected spanning 2‐valent subgraph). Although it is known that every connected 2k‐valent infinite circulant graph has a two‐way‐infinite Hamilton path, there exist many such graphs that do not have a decomposition into k edge‐disjoint two‐way ...
Darryn Bryant, Sarada Herke, Barbara Maenhaut, Bridget S. Webb   +3 more
wiley   +1 more source

Domination parameters on Cayley digraphs of full transformation semigroups relative to Green’s equivalence L $\mathcal{L}$ -classes and their complements

Open Mathematics
Let T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa, Pookpienlert Chollawat, Nupo Nuttawoot   +2 more
doaj   +1 more source

Classification of H‐Circuits Having Different Length and Reduced Length of M‐Circuits on Quadratic Irrational Numbers

Journal of Mathematics, Volume 2025, Issue 1, 2025.
The construction of circuits formed by reduced quadratic irrational numbers (RQINs) under the action of Mobius groups has attracted growing attention due to their deep algebraic structure and wide range of applications. Such orbits and circuits play a significant role in modern cryptographic systems, particularly in the design of robust substitution ...
Muhammad Haris Mateen, Kholood Mohammad Alsager, Ayesha Yousaf, Kholood Alnefaie, Bijan Davvaz, Debdas Ghosh   +5 more
wiley   +1 more source

A LiDAR‐driven pruning algorithm to delineate canopy drainage areas of stemflow and throughfall drip points

Methods in Ecology and Evolution, Volume 15, Issue 11, Page 1997-2009, November 2024.
Abstract Precipitation channelled down tree stems (stemflow) or into drip points of ‘throughfall’ beneath trees results in spatially concentrated inputs of water and chemicals to the ground. Currently, these flows are poorly characterised due to uncertainties about which branches redirect rainfall to stemflow or throughfall drip points.
Collin Wischmeyer, Travis E. Swanson, Kevin E. Mueller, Nicholas R. Lewis, Jillian Bastock, John T. Van Stan II   +5 more
wiley   +1 more source

Shi arrangements and low elements in Coxeter groups

Proceedings of the London Mathematical Society, Volume 129, Issue 2, August 2024.
Abstract Given an arbitrary Coxeter system (W,S)$(W,S)$ and a non‐negative integer m$m$, the m$m$‐Shi arrangement of (W,S)$(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of (W,S)$(W,S)$. The classical Shi arrangement (m=0$m=0$) was introduced in the case of affine Weyl groups by Shi to study Kazhdan–Lusztig cells for W$W$.
Matthew Dyer, Susanna Fishel, Christophe Hohlweg, Alice Mark   +3 more
wiley   +1 more source

Groups and Cayley digraphs [PDF]

, 2016
On one hand the content of this thesis falls within the scope of Group theory, and on the other hand in the field of Graph theory. The thesis deals with Cayley digraphs of different finite groups and with identifying properties of groups from their ...
Petek, Ana
core  

Certain Structural Properties for the Direct Product of Cayley Graphs and Their Theoretical Applications

Journal of Mathematics, Volume 2024, Issue 1, 2024.
Symmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph. In this paper, we characterize the normality of the direct product of Cayley graphs and give a sufficient and necessary condition for the direct product
Li Wang, Xiaohan Ye, Weihua Yang, G. Muhiuddin   +3 more
wiley   +1 more source

A Note on Almost Moore Diagraphs of Degree Three

Journal of Mathematical and Fundamental Sciences, 2019
It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one.
Edy Tri Baskoro, Mirka Miller, Josef Siran   +2 more
doaj  

EXTREMAL CAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

, 2011
Cayley digraphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k.
XINGDE JIA, ABBY GAIL MASK, JONI SCHNEIDER   +2 more
core   +1 more source

Cayley hyper-digraphs and Cayley hypermaps

Journal of Algebraic Combinatorics
A Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on the hypervertex set.
Kai Yuan, Yan Wang
openaire   +2 more sources