Results 71 to 80 of about 8,142 (196)
Distinguishing Number for some Circulant Graphs [PDF]
, 2014 Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain +2 more
core
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
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
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
Representation of Cyclotomic Fields and Their Subfields [PDF]
, 2012 Let $\K$ be a finite extension of a characteristic zero field $\F$. We say that the pair of $n\times n$ matrices $(A,B)$ over $\F$ represents $\K$ if $\K \cong \F[A]/$ where $\F[A]$ denotes the smallest subalgebra of $M_n(\F)$ containing $A$ and $$ is an
A. K. Lal +3 more
core
Distance magic circulant graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz, Dalibor Froncek
openaire +2 more sources
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
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
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
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