Results 91 to 100 of about 410 (178)

Routing in circulant graphs based on a virtual coordinate system

Учёные записки Казанского университета: Серия Физико-математические науки
This article explores routing methods in two-dimensional circulant graphs where each vertex is linked to four neighboring ones. The unique symmetries of the circulant graph make it a viable topology for high-performance computing devices, such as ...
A. M. Sukhov, A. Y. Romanov, E. V. Glushak   +2 more
doaj   +1 more source

Harmonic–Arithmetic Index for the Generalized Mycielskian Graphs and Graphenes With Curvilinear Regression Models of Benzenoid Hydrocarbons

Computational and Mathematical Methods
The generalized Mycielskian graphs are known for their advantageous properties employed in interconnection networks in parallel computing to provide efficient and optimized network solutions. This paper focuses on investigating the bounds and computation
Pooja Danushri Namidass, Shobana Loganathan   +1 more
doaj   +1 more source

RT-Symmetric Laplace Operators on Star Graphs: Real Spectrum and Self-Adjointness

Advances in Mathematical Physics, 2015
How ideas of PT-symmetric quantum mechanics can be applied to quantum graphs is analyzed, in particular to the star graph. The class of rotationally symmetric vertex conditions is analyzed.
Maria Astudillo, Pavel Kurasov, Muhammad Usman   +2 more
doaj   +1 more source

Simulation of specialized routing algorithms in networks-on-chip represented by series of circulant topology families

Учёные записки Казанского университета: Серия Физико-математические науки
This article examines series of families of two-dimensional circulant networks with rectangular L-shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings between the links and a bounded length of the maximum link ...
M. A. Malikov, E. A. Monakhova, E. R. Rzaev, A. Y. Romanov   +3 more
doaj   +1 more source

L(2, 1)-Labeling of Circulant Graphs

Discussiones Mathematicae Graph Theory, 2019
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj   +1 more source

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)\).
openaire   +3 more sources

PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES

Barekeng
Let be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj   +1 more source

Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]

Micromachines (Basel), 2023
Romanov AY, Myachin NM, Lezhnev EV, Ivannikov AD, El-Mesady A.   +4 more
europepmc   +1 more source

Quantum LDPC Codes Based on Cocyclic Block Matrices. [PDF]

Entropy (Basel), 2023
Li Y, Guo Y.
europepmc   +1 more source

On Edge Transitive Circulant Graphs

Tokyo Journal of Mathematics, 1996
This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire   +3 more sources