Results 101 to 110 of about 8,162 (190)
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose 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 +3 more
doaj +1 more source
Colouring Clique-Hypergraphs of Circulant Graphs
Graphs and Combinatorics, 2008 A clique coloring of a graph \(G\) is a coloring of the vertices of \(G\) so that no maximal clique of size at least two is monochromatic. The clique hypergraph, \(\mathcal{H}(G)\), of a graph \(G\) has \(V(G)\) as its set of vertices and the maximal cliques of \(G\) as its hyperedges. A vertex coloring of \(\mathcal{H}(G)\) is a clique coloring of \(G\
Campos, C. N. +2 more
openaire +1 more source
Total colorings of some classes of four regular circulant graphs
AKCE International Journal of Graphs and CombinatoricsThe 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 +3 more
doaj +1 more source
The Existence of Selfcomplementary Circulant Graphs
European Journal of Combinatorics, 1996 The authors determine the values of \(n\) for which there exist self-complementary circulant graphs of order \(n\).
Fronček, Dalibor +2 more
openaire +1 more source
Invariance of KMS states on graph C*-algebras under classical and quantum symmetry
, 2018 We study invariance of KMS states on graph C*-algebras coming from strongly connected and circulant graphs under the classical and quantum symmetry of the graphs.
Joardar, Soumalya, Mandal, Arnab
core
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 +1 more
doaj
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
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 +2 more
doaj +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
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 +2 more
doaj +1 more source