Results 91 to 100 of about 975,970 (227)
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 239-260, July 2025.ABSTRACT The directed Oberwolfach problem OP * ( m 1 , … , m k ) asks whether the complete symmetric digraph K n *, assuming n = m 1 + ⋯ + m k, admits a decomposition into spanning subdigraphs, each a disjoint union of k directed cycles of lengths m 1 , … , m k.
Suzan Kadri, Mateja Šajna
wiley +1 more source
On Edge Transitive Circulant Graphs
Tokyo Journal of Mathematics, 1996 This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire +3 more sources
On the perfect 1-factorisation problem for circulant graphs of degree 4 [PDF]
, 2014 A 1-factorisation of a graph G is a partition of the edge set of G into 1 factors (perfect matchings); a perfect 1-factorisation of G is a 1-factorisation of G in which the union of any two of the 1-factors is a Hamilton cycle in G.
Herke, Sarada
core
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry
Journal of Combinatorial Designs, Volume 33, Issue 6, Page 222-234, June 2025.ABSTRACT We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction.
Alex Elzenaar, Shayne Waldron
wiley +1 more source
Restricted triangulation on circulant graphs
Open Mathematics, 2018 The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C(n, S) be a circulant graph on n vertices with jump value set
Ali Niran Abbas +2 more
doaj +1 more source
Ultrasound in Obstetrics &Gynecology, Volume 65, Issue 6, Page 749-760, June 2025.ABSTRACT Objective Placental dysfunction can result in small‐for‐gestational age (SGA) or fetal growth restriction (FGR). The aim of this prospective cohort study was to assess the association of the cerebroplacental ratio (CPR) and other more conventional fetoplacental Doppler indices, circulating placental growth factor (PlGF) levels and soluble fms ...
J. Hong +6 more
wiley +1 more source
Road traffic estimation and algorithmic routing in a spatially dependent network
Scandinavian Journal of Statistics, Volume 52, Issue 2, Page 1058-1091, June 2025.ABSTRACT This work concerns a procedure to estimate the joint distribution of the per‐edge travel times in a road traffic network with spatial dependence. The constructed estimator, based on the realized travel times of a collection of independently operating probe vehicles traversing the network, is shown to be consistent and rate‐optimal.
Rens Kamphuis +2 more
wiley +1 more source
Betti numbers of some circulant graphs [PDF]
Czechoslovak Mathematical Journal, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdi Makvand, Mohsen, Mousivand, Amir
openaire +2 more sources
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj +1 more source
The metric dimension of circulant graphs and their Cartesian products [PDF]
Opuscula Mathematica, 2017 Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there ...
Kevin Chau, Shonda Gosselin
doaj +1 more source