Results 101 to 110 of about 590,064 (163)

Domination dans les graphes circulant

, 2017
A Cayley graph on a group Γ with the generating set S ⊂ Γ is a graph costructed out of Γ. A circulant graph is a Cayley graph on a cyclic group denoted by Circ(n, S). In this paper, we address the problem domination in circulant graphs.
Tamene Kenfack, Samuel
core   +1 more source

Total colorings of some classes of four regular circulant graphs

AKCE International Journal of Graphs and Combinatorics
The total chromatic number, [Formula: see text] is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, [Formula:
R. Navaneeth, J. Geetha, K. Somasundaram, Hung-Lin Fu   +3 more
doaj   +1 more source

On metric dimension of edge comb product of vertex-transitive graphs [PDF]

Transactions on Combinatorics
Suppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati, Dindin Sobiruddin, Maifalinda Fatra, Fawwaz Hadiputra   +3 more
doaj   +1 more source

A New Algorithm for Computing the Distance and the Diameter in Circulant Graphs

In the present study, we focus on circulant graphs, Cn(S), with set of vertices {0,1,…,n−1} and in which two distinct vertices i and j are adjacent if and only if |i−j|n∈S, where S is a generating set.
Mustapha Kchikech, Laila Loudiki
core   +1 more source

From spline wavelet to sampling theory on circulant graphs and beyond– conceiving sparsity in graph signal processing [PDF]

, 2018
Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing.
Kotzagiannidis, Madeleine S.
core   +1 more source

Isomorphism of circulant graphs and digraphs

Discrete Mathematics, 1979
AbstractLet S⊆ {1, …, n−1} satisfy −S = S mod n. The circulant graph G(n, S) with vertex set {v0, v1,…, vn−1} and edge set E satisfies vivj ϵ E if and only if j − i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = − S.
Brian Alspach, Torrence D. Parsons
openaire   +2 more sources

Symmetry Parameters of Two-Generator Circulant Graphs [PDF]

The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give their ...
Cockburn, Sally, Loeb, Sarah
core   +1 more source

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 the chromatic number of circulant graphs

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

Betti numbers of some circulant graphs [PDF]

, 2019
summary:Let $o(n)$ be the greatest odd integer less than or equal to $n$. In this paper we provide explicit formulae to compute $\mathbb {N}$-graded Betti numbers of the circulant graphs $C_{2n}(1,2,3,5,\ldots ,o(n))$.
Mousivand, Amir, Abdi Makvand, Mohsen
core   +1 more source