Results 1 to 10 of about 332 (178)

On Dispersability of Some Circulant Graphs [PDF]

Journal of Graph Algorithms and Applications, 2022
The matching book thickness of a graph is the least number of pages in a book embedding such that each page is a matching. A graph is dispersable if its matching book thickness equals its maximum degree.
Paul C. Kainen, Samuel Joslin, Shannon Overbay   +2 more
doaj   +4 more sources

The Regularity of Some Families of Circulant Graphs

Mathematics, 2019
We compute the Castelnuovo−Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs.
Miguel Eduardo Uribe-Paczka, Adam Van Tuyl   +1 more
doaj   +3 more sources

Integral circulant graphs

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wasin So
exaly   +3 more sources

The local vertex anti-magic coloring for certain graph operations [PDF]

Heliyon
This work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
doaj   +2 more sources

Some Invariants of Circulant Graphs [PDF]

Symmetry, 2016
Topological indices and polynomials are predicting properties like boiling points, fracture toughness, heat of formation, etc., of different materials, and thus save us from extra experimental burden. In this article we compute many topological indices for the family of circulant graphs.
Shin Min Kang, Waqas Nazeer, Muhmmad Mobeen Munir   +2 more
exaly   +2 more sources

Dissociation in circulant graphs and integer distance graphs

Discussiones Mathematicae Graph Theory
Summary: A dissociation set of a graph \(G\) is a set of vertices which induces a subgraph of \(G\) with maximum degree at most 1, or equivalently, a set of vertices whose complement in \(G\) is a 3-path vertex cover (intersecting every 3-path of \(G)\).
Jia Huang
doaj   +3 more sources

On the chromatic number of circulant graphs

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oriol Serra
exaly   +2 more sources

On planarity and colorability of circulant graphs

Discrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clemens Heuberger
exaly   +2 more sources

On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing

Algorithms, 2022
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, Aleksandr Y. Romanov, Aleksandr A. Amerikanov, Alexander D. Ivannikov   +3 more
doaj   +1 more source

On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches

Alexandria Engineering Journal, 2022
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, Omar Bazighifan, Qasem Al-Mdallal   +2 more
doaj   +1 more source