Results 111 to 120 of about 990 (211)

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

International Journal of Information and Communication Technology Research, 2016
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the ...
Mohammad Hesam Tadayon, Mohammad Mohammadi   +1 more
doaj  

On Ádám's conjecture for circulant graphs

Discrete Mathematics, 1997
The content of this article is analogous to the one of the author's former paper [J. Comb. Theory, Ser. A 72, No. 1, 118-134 (1995; Zbl 0833.05063)]. Now the author proves the reviewer's conjecture in case of an \(n\) (number of vertices) such that \(n/4\) is a square-free odd integer.
openaire   +1 more source

Max-cut in circulant graphs

Discrete Mathematics, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svatopluk Poljak, Daniel Turzík
openaire   +1 more source

Hypo-efficient domination and hypo-unique domination

Communications in Combinatorics and Optimization, 2016
For a graph $G$ let $\gamma (G)$ be its domination number.‎ ‎We define a graph G to be‎ ‎(i) a hypo-efficient domination graph (or a hypo-$\mathcal{ED}$ graph)‎ ‎if $G$ has no efficient dominating set (EDS) but every graph formed‎ ‎ by ...
V‎. ‎Samodivkin
doaj   +1 more source

The projective plane crossing number of the circulant graph C(3k;{1,k})

, 2012
In this paper we prove that the projective plane crossing number of the circulant graph C(3k;{1,k}) is k-1 for k ≥ 4, and is 1 for k ...
Ho, Pak
core   +1 more source

On the symmetries of some classes of recursive circulant graphs

Transactions on Combinatorics, 2014
A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties.
Seyed Morteza Mirafzal
doaj  

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

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

Canonization of a random circulant graph by counting walks [PDF]

It is well known that almost all graphs are canonizable by a simple combinatorial routine known as colour refinement, also referred to as the 1-dimensional Weisfeiler–Leman algorithm.
Zhukovskii, M., Verbitsky, O.
core   +3 more sources

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