Results 1 to 10 of about 590,064 (163)
Resolvability in Subdivision Graph of Circulant Graphs
Circulant networks are a very important and widely studied class of graphs due to their interesting and diverse applications in networking, facility location problems, and their symmetric properties. The structure of the graph ensures that it is symmetric about any line that cuts the graph into two equal parts.
Syed Ahtsham Ul Haq Bokhary
exaly +3 more sources
Typical circulant double coverings of a circulant graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Ho Kwak, Rongquan Feng
exaly +6 more sources
On the page-number of a circulant graph
The page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive ...
Xiaoyuan Dong, Dengju Ma
doaj +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wasin So
exaly +4 more sources
On Dispersability of Some Circulant Graphs [PDF]
20 pages, 14 figures, accepted for publication in the Journal of Graph Algorithms and ...
Paul C. Kainen +2 more
openaire +4 more sources
HS-integral and Eisenstein integral mixed circulant graphs
A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady +2 more
doaj +1 more source
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete ...
Ahmed El-Mesady +3 more
doaj +1 more source
On Embeddings of Circulant Graphs [PDF]
A circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$, and as such, admits a transitive action of $\mathbb{Z}_n$ on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces.
Conder, Marston, Grande, Ricardo
openaire +4 more sources
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as selfâinterest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source

