Results 51 to 60 of about 990 (211)
The irregularity strength of circulant graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +2 more sources
On Adjacency Metric Dimension of Some Families of Graph
Journal of Function Spaces, 2022 Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Qa⊂VG is considered to be an adjacency metric generator for G if u1,u2∈V\Qa (supposing each pair); there must exist a vertex q∈
Ali N. A. Koam +4 more
doaj +1 more source
Broader families of cordial graphs
Indonesian Journal of Combinatorics, 2021 A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.
Christian Barrientos, Sarah Minion
doaj +1 more source
Some Invariants of Circulant Graphs [PDF]
Symmetry, 2016 Topological indices and polynomials are predicting properties like boiling points, fracture toughness, heat of formation, etc., of different materials, and thus save us from extra experimental burden. In this article we compute many topological indices for the family of circulant graphs.
Mobeen Munir +3 more
openaire +1 more source
Sum coloring of distance and circulant graphs
, 2005 International audienceA distance graph (resp. circulant graph) is a graph obtained from the path (resp. the cycle) of order n by adding chordal edges between any pair of vertices at distance d\in D, D\subseteq Zn.
Kheddouci, Hamamache, Effantin, Brice
core +4 more sources
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
The metric dimension of circulant graphs [PDF]
Opuscula MathematicaA pair of vertices \(x\) and \(y\) in a graph \(G\) are said to be resolved by a vertex \(w\) if the distance from \(x\) to \(w\) is not equal to the distance from \(y\) to \(w\).
Tapendra BC, Shonda Dueck
doaj +1 more source
ENUMERATING TYPICAL ABELIAN PRIME-FOLD COVERINGS OF A CIRCULANT GRAPH
, 2019 Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J.
Kwon, YS, Kwak, JH, Feng, RQ
core +1 more source