AbstractA subset of the vertex set of a graph G, W⊆V(G), is a (k,τ)-regular set if it induces a k-regular subgraph of G and every vertex not in the subset has τ neighbors in it. In this paper we deal with the existence of (k,τ)-regular sets associated with all distinct eigenvalues. We show some families that have this property and we give some results concerning the existence of such sets considering restrictions on the symbol of circulant graphs
AbstractA graph G has constant μ − μ(G) if any two vertices that are not adjacent have μ common neig...
A graph G has constant u = u(G) if any two vertices that are not adjacent have u common neighbours. ...
AbstractWe study the connected regular graphs with four distinct eigenvalues. Properties and feasibi...
A subset of the vertex set of a graph G, W ⊆ V (G), is a (k, τ)-regular set if it induces a k-regula...
AbstractA subset of the vertex set of a graph G, W⊆V(G), is a (k,τ)-regular set if it induces a k-re...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
A (κ, τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such th...
AbstractA (κ,τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph ...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has lea...
The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as ...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility con...
AbstractA graph G has constant μ − μ(G) if any two vertices that are not adjacent have μ common neig...
A graph G has constant u = u(G) if any two vertices that are not adjacent have u common neighbours. ...
AbstractWe study the connected regular graphs with four distinct eigenvalues. Properties and feasibi...
A subset of the vertex set of a graph G, W ⊆ V (G), is a (k, τ)-regular set if it induces a k-regula...
AbstractA subset of the vertex set of a graph G, W⊆V(G), is a (k,τ)-regular set if it induces a k-re...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
A (κ, τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such th...
AbstractA (κ,τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph ...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has lea...
The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as ...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility con...
AbstractA graph G has constant μ − μ(G) if any two vertices that are not adjacent have μ common neig...
A graph G has constant u = u(G) if any two vertices that are not adjacent have u common neighbours. ...
AbstractWe study the connected regular graphs with four distinct eigenvalues. Properties and feasibi...