Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this article we prove that the maximum spectral radius ρ(G), among all graphs G∈G(n,α), is reached at a unique graph. As a byproduct we obtain an upper for ρ(G), when G∈G(n,α).Fil: Conde, Cristian Marcelo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Saavedra 15. Instituto Argentino de Matemática Alberto Calderón; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Dratman, Ezequiel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Grippo, Luciano Norberto...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractWe characterize the graphs which achieve the maximum value of the spectral radius of the adj...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
Let t≥3 and G be a graph of order n, with no K2,t minor. If n\u3e400t6, then the spectral radius μ(G...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
In this paper we study three families of graphs, one is the graphs of order <i>n</i> with connectivi...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractThe independence number α(G) of G is defined as the maximum cardinality of a set of pairwise...
AbstractWe characterize the graphs which achieve the maximum value of the spectral radius of the adj...
G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the...
Let t≥3 and G be a graph of order n, with no K2,t minor. If n\u3e400t6, then the spectral radius μ(G...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D
This paper generalizes and unifies the existing spectral bounds on the k-independence number of a gr...
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is...
AbstractLet GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper character...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...