Results 81 to 90 of about 990 (211)
Two families of circulant nut graphs
, 2022 A circulant nut graph is a non-trivial simple graph whose adjacency matrix is a circulant matrix of nullity one such that its non-zero null space vectors have no zero elements.
Damnjanović, Ivan
core +1 more source
Perfect codes in circulant graphs
Discrete Mathematics, 2017 A perfect code in a graph $Γ= (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $Γ$ is a subset $C$ of $V$ such that every vertex of $V$ is adjacent to exactly one vertex in $C$. A perfect code in the Hamming graph $H(n, q)$ agrees with a
Rongquan Feng, He Huang, Sanming Zhou
openaire +3 more sources
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
From spline wavelet to sampling theory on circulant graphs and beyond– conceiving sparsity in graph signal processing [PDF]
, 2018 Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing.
Kotzagiannidis, Madeleine S.
core +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
Spectral analysis of the wreath product of a complete graph with a cocktail party graph
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018 Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the wreath product of two graphs, which is derived from the homonymous product of groups.
Francesco Belardo +2 more
doaj +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
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
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
Circulant Digraphs with Larger Linear Guessing Number and Smaller Degree
MathematicsThe guessing number of a digraph is a new invariant in graph theory raised by S. Riis in 2006 and based on its applications in network coding and boolean circuit complexity theory. In this paper, we present the lower and upper bounds on a guessing number
Aixian Zhang, Keqin Feng
doaj +1 more source