Results 31 to 40 of about 410 (178)
Incidence and Laplacian matrices of wheel graphs and their inverses
The American Journal of Combinatorics, 2023 It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
On the Metric Index of Circulant Networks–An Algorithmic Approach
IEEE Access, 2019 A vertex v of a graph G uniquely determines (resolves) a pair (v1, v2) of vertices of G if the distance between v and v1 is different from the distance between v and v2.
Imran Khalid +2 more
doaj +1 more source
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
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
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
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
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
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
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