The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal cliques of size 2 or larger is derived.Publisher's Versio
Let G be an undirected unweighted graph on n vertices and let L be its Laplacian matrix. It is known...
AbstractThe paper reviews some of the existing exact bounds to the maximum clique of a graph and suc...
AbstractThe l-connectivity ϰ/(G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices t...
AbstractThe structure of connected graphs of given size and order that have minimal algebraic connec...
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 ...
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 ...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
We propose a class of graphsG∗D(n1, n2,..., nD+1), containing of a chain ofD+1 cliquesKn1,Kn2,...,Kn...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian ...
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic ...
AbstractThe algebraic connectivity of G is the second smallest eigenvalue of its Laplacian matrix. L...
AbstractGiven an undirected graph G=(V,E) and a nonempty subset X⊆V, the edge density of X is given ...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
AbstractLet G be a connected graph of order n. The algebraic connectivity of G is the second smalles...
Let G be an undirected unweighted graph on n vertices and let L be its Laplacian matrix. It is known...
AbstractThe paper reviews some of the existing exact bounds to the maximum clique of a graph and suc...
AbstractThe l-connectivity ϰ/(G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices t...
AbstractThe structure of connected graphs of given size and order that have minimal algebraic connec...
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 ...
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 ...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
We propose a class of graphsG∗D(n1, n2,..., nD+1), containing of a chain ofD+1 cliquesKn1,Kn2,...,Kn...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian ...
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic ...
AbstractThe algebraic connectivity of G is the second smallest eigenvalue of its Laplacian matrix. L...
AbstractGiven an undirected graph G=(V,E) and a nonempty subset X⊆V, the edge density of X is given ...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
AbstractLet G be a connected graph of order n. The algebraic connectivity of G is the second smalles...
Let G be an undirected unweighted graph on n vertices and let L be its Laplacian matrix. It is known...
AbstractThe paper reviews some of the existing exact bounds to the maximum clique of a graph and suc...
AbstractThe l-connectivity ϰ/(G) of a graph G of order p ⩾ l − 1 is the minimum number of vertices t...
DOI
Add to ORKG