Results 71 to 80 of about 332 (178)
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
The eigenvalues and energy of integral circulant graphs [PDF]
Transactions on Combinatorics, 2012 A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency matrix is circulant. Let $D$ be aset of positive, proper divisors of the integer $n>1$.
Mohsen Mollahajiaghaei
doaj
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
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
On Solvable Groups and Circulant Graphs
European Journal of Combinatorics, 2000 Solvable graphs are defined to be graphs whose automorphism group contains a solvable subgroup. A circulant graph of order \(n\) has an automorphism group which contains an \(n\)-cycle. In this paper every vertex-transitive graph \(\Gamma\) of order \(n\) with \(\text{gcd}(n,\varphi(n))= 1\) is proved to be isomorphic to a circulant graph of order \(n\)
openaire +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
The metric dimension of circulant graphs [PDF]
Opuscula MathematicaA pair of vertices \(x\) and \(y\) in a graph \(G\) are said to be resolved by a vertex \(w\) if the distance from \(x\) to \(w\) is not equal to the distance from \(y\) to \(w\).
Tapendra BC, Shonda Dueck
doaj +1 more source
International Journal of Communication Systems, Volume 38, Issue 8, 25 May 2025.Overview of blockchain supported multisignature algorithm for IoV. ABSTRACT The Internet of Vehicles (IoV) has emerged as a promising application capable of enhancing transportation efficiency and providing a variety of mobile services to drivers. This IoV enables real‐time data sharing among vehicles and infrastructure, allowing for better traffic ...
Dushyant Kumar Yadav +3 more
wiley +1 more source
A New Algorithm for Computing the Distance and the Diameter in Circulant Graphs
AlgorithmsIn the present study, we focus on circulant graphs, Cn(S), with set of vertices {0,1,…,n−1} and in which two distinct vertices i and j are adjacent if and only if |i−j|n∈S, where S is a generating set.
Laila Loudiki, Mustapha Kchikech
doaj +1 more source