Results 71 to 80 of about 410 (178)
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
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
On the rank of the Doob graph and its complement
Kuwait Journal of Science, 2018 We compute the rank of the circulant Doob graph defined in Doob (2002). We also compute the rank and the determinant of its complement graph.
Ilhan Hacioglu, Kerem Kaskaloglu
doaj
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
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj +1 more source
Isomorphism of circulant graphs and digraphs
Discrete Mathematics, 1979 AbstractLet S⊆ {1, …, n−1} satisfy −S = S mod n. The circulant graph G(n, S) with vertex set {v0, v1,…, vn−1} and edge set E satisfies vivj ϵ E if and only if j − i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = − S.
Brian Alspach, Torrence D. Parsons
openaire +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
Moving average network examples for asymptotically stable periodic orbits of monotone maps
Electronic Journal of Qualitative Theory of Differential Equations, 2018 For a certain type of discrete-time nonlinear consensus dynamics, asymptotically stable periodic orbits are constructed. Based on a simple ordinal pattern assumption, the Frucht graph, two Petersen septets, hypercubes, a technical class of circulant ...
Barna Garay, Judit Várdai
doaj +1 more source
On the chromatic number of circulant graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Javier Barajas, Oriol Serra
openaire +1 more source
Programmable photonic unitary circuits for light computing
Nanophotonics, Volume 14, Issue 10, Page 1429-1449, May 2025.Abstract Unitarity serves as a fundamental concept for characterizing linear and conservative wave phenomena in both classical and quantum systems. Developing platforms that perform unitary operations on light waves in a universal and programmable manner enables the emulation of complex light–matter interactions and the execution of general‐purpose ...
Kyuho Kim +5 more
wiley +1 more source