International audienceWe characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the regular bipartite graphs and their extensions obtained by adding edges between vertices with the same value for the given eigenvector. Graphs with eigenvectors with components in {-1,0,+1} are called trivalent and are shown to be soft-regular graphs – graphs such that vertices associated with non-zero components have the same degree – and their extensions via certain transformations
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractIf G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degree...
AbstractRelations between Laplacian eigenvectors and eigenvalues and the existence of almost equitab...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
Given a,b ∈ N such that a \u3e b we define a Kneser-like bipartite graph G(a, b), whose two bipartite...
Given a,b ∈N such that a \u3e b we define a Kneser-like bipartite graph G(a,b), whose two bipartite s...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus...
In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integ...
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable parti...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractIf G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degree...
AbstractRelations between Laplacian eigenvectors and eigenvalues and the existence of almost equitab...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
Given a,b ∈ N such that a \u3e b we define a Kneser-like bipartite graph G(a, b), whose two bipartite...
Given a,b ∈N such that a \u3e b we define a Kneser-like bipartite graph G(a,b), whose two bipartite s...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus...
In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integ...
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable parti...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractIf G is a graph, its Laplacian is the difference of the diagonal matrix of its vertex degree...
AbstractRelations between Laplacian eigenvectors and eigenvalues and the existence of almost equitab...