Results 81 to 90 of about 590,064 (163)
The Fibonacci numbers of certain subgraphs of circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2015 The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo +1 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
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
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
The Pfaffian property of circulant graphs
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuliang Lu, Lianzhu Zhang, Yan Wang
openaire +2 more sources
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
Circulant Matrices and Time-series Analysis [PDF]
This paper sets forth some of the salient results in the algebra of circulant matrices which can be used in time-series analysis. It provides easy derivations of some results that are central to the analysis of statistical periodograms and empirical ...
Stephen Pollock
core
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
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