Results 41 to 50 of about 1,046 (212)
Colouring Clique-Hypergraphs of Circulant Graphs
, 2015 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique of size at least two is ...
Dantas, S, Campos, CN, de Mello, CP
core +1 more source
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v).
Isaac Armando Reiter, Ju Zhou
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\).
Dalibor Froncek +2 more
openaire +1 more source
Eccentricity-Based Topological Invariants of Some Chemical Graphs
Atoms, 2019 Topological index is an invariant of molecular graphs which correlates the structure with different physical and chemical invariants of the compound like boiling point, chemical reactivity, stability, Kovat’s constant etc.
Nazeran Idrees +2 more
doaj +1 more source
Circulant Graphs And Spherical Codes
, 2015 Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing.
Muniz M. +3 more
core +1 more source
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +1 more source
A Preconditioned Majorization‐Minimization Method for ℓ2$$ {\ell}^2 $$‐ℓq$$ {\ell}^q $$ Minimization
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT The need to minimize a linear combination of an expression that involves an ℓq$$ {\ell}^q $$‐norm of a linear transformation of the computed solution and the ℓ2$$ {\ell}^2 $$‐norm of the residual error arises in image restoration as well as in statistics.
A. Buccini +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1980 AbstractAn algebraic characterization is given for those Cayley graphs for cyclic groups in which the neighborhood of any vertex is a cycle. A triangular imbedding is obtained for each such graph, either in the sphere, the torus, or the Klein bottle.
openaire +2 more sources
Solitaire clobber on circulant graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pará, Telma +2 more
openaire +1 more source
Supermagic Generalized Double Graphs 1
Discussiones Mathematicae Graph Theory, 2016 A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj +1 more source