Results 1 to 10 of about 990 (211)
Discrete Mathematics, 2011 A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs.
Hoshino, Richard +3 more
core +3 more sources
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
The Fibonacci numbers of certain subgraphs of circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2015 The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo +1 more
doaj +1 more source
On the rank of the Doob graph and its complement
Kuwait Journal of Science, 2018 We compute the rank of the circulant Doob graph defined in Doob (2002). We also compute the rank and the determinant of its complement graph.
Ilhan Hacioglu, Kerem Kaskaloglu
doaj
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj +1 more source
Sampling and reconstruction of sparse signals on circulant graphs – an introduction to graph-FRI [PDF]
, 2017 With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, PL, Kotzagiannidis, MS
core +1 more source
Moving average network examples for asymptotically stable periodic orbits of monotone maps
Electronic Journal of Qualitative Theory of Differential Equations, 2018 For a certain type of discrete-time nonlinear consensus dynamics, asymptotically stable periodic orbits are constructed. Based on a simple ordinal pattern assumption, the Frucht graph, two Petersen septets, hypercubes, a technical class of circulant ...
Barna Garay, Judit Várdai
doaj +1 more source
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
Edge metric dimension of some classes of circulant graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 Let G = (V (G), E(G)) be a connected graph and x, y ∈ V (G), d(x, y) = min{ length of x − y path } and for e ∈ E(G), d(x, e) = min{d(x, a), d(x, b)}, where e = ab. A vertex x distinguishes two edges e1 and e2, if d(e1, x) ≠ d(e2, x). Let WE = {w1, w2, . .
Ahsan Muhammad +2 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