筛选条件 共查询到414条结果
排序方式
Oriented graphs determined by their generalized skew spectrum

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 622 ()

Spectral characterization of graphs is a well-studied topic in spectral graph theory which has received a lot of attention from researchers. The spect......

The extension dimension of triangular matrix algebras

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 624 ()

Y Let T, U be two Artin algebras and M-U(T) be a U-T-bimodule. In this paper, we study the extension dimension of the formal triangular matrix algebra......

Extremal spectral radius of K-3,K-3/K-2,K-4-minor free graphs

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 628 ()

Let rho*(s, t) be the largest real root of the quadratic equation: (x - s + 2)(x - t + 1) - (n - s + 1)(s - 1) = 0 and F-s,F-t(n) := Ks-1 boolean OR (......

A vertex weighted Bartholdi zeta function for a graph

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 621 ()

We define a vertex weighted Bartholdi zeta function of a graph G, and give a determinant expression of it. Furthermore, we define a vertex weighted Ba......

The smallest spectral radius of bicyclic uniform hypergraphs with agiven size

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 622 ()

Identifying graphs with extremal properties is an extensively studied topic in spectral graph theory. In this paper, we study the log-concavity of a t......

The A(alpha)-spectral radius of graphs with a prescribed number of edges for 1/2 <= alpha <= 1

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 628 ()

For 0 &lt;= alpha &lt;= 1, the A(alpha)-matrix of graph G is defined as A(alpha)(G) = alpha D(G) + (1 - alpha)A(G), where D(G) and A(G) are the diagon......

Eigenvalues and chromatic number of a signed graph

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 619 ()

For a signed graph Sigma, let chi(Sigma), lambda(1) and lambda(n) be the chromatic number, the maximum eigenvalue and the minimum eigenvalue of Sigma,......

Combinatorial entanglement

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 619 ()

We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a ......

Riordan arrays, Lukasiewicz paths and Narayana polynomials

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 622 ()

By counting weighted Lukasiewicz paths and weighted Schroder paths, we obtain two Riordan arrays in which the bivariate Narayana polynomials occur in ......

Decomposition of exterior and symmetric squares in characteristic two

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 624 ()

Let V be a finite-dimensional vector space over a field of characteristic two. As the main result of this paper, for every nilpotent element epsilon i......

On the largest eigenvalue of a mixed graph with partial orientation

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 627 ()

Let G be a connected graph and let T be an acyclic set of edges of G. A partial orientation sigma of G with respect to T is an orientation of the edge......

On maximal energy of line graphs with given parameters

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 619 ()

The maximal energies of line graphs are determined over all graphs with fixed matching number, fractional matching number and bipartiteness, respectiv......

Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 620 ()

For a graph G =(V, E) and i, j. is an element of V, denote by d(i), d(j) the degrees of vertices i, jin G. Let f(d(i), d(j)) &gt; 0 be a function symm......

Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 622 ()

In this paper, we consider the eigenvalue problem for the class of quasi-Cauchy-Vandermonde (qCV) matrices belonging to the class of generalized sign ......

Graphs with few distinct D-eigenvalues determined by their D-spectra

期刊: LINEAR ALGEBRA AND ITS APPLICATIONS, 2021; 628 ()

Two graphs are said to be D-cospectral if they have the same distance spectrum. A graph is said to be determined by its distance spectrum if there is ......

共414条页码: 1/28页15条/页