On conjectures involving second largest signless Laplacian eigenvalue of graphs

Let G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the Laplacian matrix of G is L(G)=D(G)-A(G) and the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper we obtain a lower bound on the second largest signless Laplacian eigenvalue and an upper bound on the smallest signless Laplacian eigenvalue of G. In [5], Cvetkovi? et al. have given a series of 30 conjectures on Laplacian eigenvalues and signless Laplacian eigenvalues of G (see also [1]). Here we prove five conjectures.     

On the sum of the Laplacian eigenvalues of a tree

Given an n-vertex graph G=(V,E), the Laplacian spectrum of G is the set of eigenvalues of the Laplacian matrix L=D-A, where D and A denote the diagonal matrix of vertex-degrees and the adjacency matrix of G, respectively. In this paper, we study the Laplacian spectrum of trees. More precisely, we find a new upper bound on the sum of the k largest Laplacian eigenvalues of every n-vertex tree, where k∈{1,…,n}. This result is used to establish that the n-vertex star has the highest Laplacian energy over all n-vertex trees, which answers affirmatively to a question raised by Radenkovi? and Gutman [10].     

On the reduced signless Laplacian spectrum of a degree maximal graph

For a (simple) graph G, the signless Laplacian of G is the matrix A(G)+D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix Δ(G)+B(G), where B(G) is the reduced adjacency matrix of G and Δ(G) is the diagonal matrix whose diagonal entries are the common degrees for vertices belonging to the same neighborhood equivalence class of G. A graph is said to be (degree) maximal if it is connected and its degree sequence is not majorized by the degree sequence of any other connected graph. For a maximal graph, we obtain a formula for the characteristic polynomial of its reduced signless Laplacian and use the formula to derive a localization result for its reduced signless Laplacian eigenvalues, and to compare the signless Laplacian spectral radii of two well-known maximal graphs. We also obtain a necessary condition for a maximal graph to have maximal signless Laplacian spectral radius among all connected graphs with given numbers of vertices and edges.     

Unique representation domains, II

Given a star operation ∗ of finite type, we call a domain R a ∗-unique representation domain (∗-URD) if each ∗-invertible ∗-ideal of R can be uniquely expressed as a ∗-product of pairwise ∗-comaximal ideals with prime radical. When ∗ is the t-operation we call the ∗-URD simply a URD. Any unique factorization domain is a URD. Generalizing and unifying results due to Zafrullah [M. Zafrullah, On unique representation domains, J. Nat. Sci. Math. 18 (1978) 19-29] and Brewer-Heinzer [J.W. Brewer, W.J. Heinzer, On decomposing ideals into products of comaximal ideals, Comm. Algebra 30 (2002) 5999-6010], we give conditions for a ∗-ideal to be a unique ∗-product of pairwise ∗-comaximal ideals with prime radical and characterize ∗-URD’s. We show that the class of URD’s includes rings of Krull type, the generalized Krull domains introduced by El Baghdadi and weakly Matlis domains whose t-spectrum is treed. We also study when the property of being a URD extends to some classes of overrings, such as polynomial extensions, rings of fractions and rings obtained by the D+XD_S[X] construction.     

On incidence energy of a graph

The Laplacian-energy like invariant LEL(G) and the incidence energy IE(G) of a graph are recently proposed quantities, equal, respectively, to the sum of the square roots of the Laplacian eigenvalues, and the sum of the singular values of the incidence matrix of the graph G. However, IE(G) is closely related with the eigenvalues of the Laplacian and signless Laplacian matrices of G. For bipartite graphs, IE=LEL. We now point out some further relations for IE and LEL: IE can be expressed in terms of eigenvalues of the line graph, whereas LEL in terms of singular values of the incidence matrix of a directed graph. Several lower and upper bounds for IE are obtained, including those that pertain to the line graph of G. In addition, Nordhaus-Gaddum-type results for IE are established.     

Subgraphs and the Laplacian spectrum of a graph

Let G be a graph and H a subgraph of G. In this paper, a set of pairwise independent subgraphs that are all isomorphic copies of H is called an H-matching. Denoting by ν(H,G) the cardinality of a maximum H-matching in G, we investigate some relations between ν(H,G) and the Laplacian spectrum of G.     

On the arithmetic of Krull monoids with infinite cyclic class group

Let H be a Krull monoid with infinite cyclic class group G and let G_P⊂G denote the set of classes containing prime divisors. We study under which conditions on G_P some of the main finiteness properties of factorization theory-such as local tameness, the finiteness and rationality of the elasticity, the structure theorem for sets of lengths, the finiteness of the catenary degree, and the existence of monotone and near monotone chains of factorizations-hold in H. In many cases, we derive explicit characterizations.     

A note on the critical ideals of a cycle

Critical ideals of a graph G which are the determinantal ideals of its generalized Laplacian matrix were first introduced by Corrales and Valencia as a generalization of the critical group. Then it was shown that critical ideals are also closely related to other properties of the graph, such as the clique number and the zero forcing number. In this note, we give a simple proof of Theorem 4.13 proved in [7], which gives a Gröbner basis of the first nontrivial critical ideal of a cycle. After that as applications we determine explicit expressions for the characteristic ideals of a cycle and the critical groups of a family of thick wheels.     

Bounds for the signless Laplacian energy of digraphs

Let G be a digraph with n vertices, a arcs, c ₂ directed closed walks of length 2. Let q1; q2;:::; q _n be the eigenvalues of the signless Laplacian matrix of G. The signless Laplacian energy of a digraph G is defined as E _SL (G) = \(\sum\limits_{i = 1}^n {\left| {{q_i} - \frac{a}{n}} \right|} \). In this paper, some lower and upper bounds are derived for the signless Laplacian energy of digraphs.     

On the divisorial spectrum of a Noetherian domain

For a Noetherian domain, the sets of divisorial primes, t-primes, and associated primes of principal ideals coincide. We study the divisorial primes of a Noetherian domain as a partially ordered set. In particular, we show that it is possible to have arbitrarily long chains and any finite amount of noncatenarity.     

The spectra of some families of digraphs

Let G be a digraph (or a graph, when seen as a symmetric digraph) with adjacency matrix A, having the eigenvalue λ with associated eigenvector v. As it is well known, the entries of v can be interpreted as charges in each vertex. Then, the linear transformation v ? Av corresponds to a natural displacement of charges, where each vertex sends a copy of its charge to its in-neighbors and absorbs a copy of the charges of its out-neighbors, so the resulting charge distribution is just λv. In this work we use this approach to derive some old and new results about the spectral characterization of G. More precisely, we show how to obtain the spectra of some families of (di)graphs, such as the partial line digraphs and the line graphs of regular or semiregular graphs.     

Characterizing local rings via homological dimensions and regular sequences

Let (R,m) be a Noetherian local ring of depth d and C a semidualizing R-complex. Let M be a finite R-module and t an integer between 0 and d. If the G_C-dimension of M/aM is finite for all ideals a generated by an R-regular sequence of length at most d−t then either the G_C-dimension of M is at most t or C is a dualizing complex. Analogous results for other homological dimensions are also given.     

Graph homomorphisms and nodal domains

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs.     

Ordering of trees with fixed matching number by the Laplacian coefficients

Let G be a simple undirected graph with the characteristic polynomial of its Laplacian matrix L(G), . Aleksandar Ili? [A. Ili?, Trees with minimal Laplacian coefficients, Comput. Math. Appl. 59 (2010) 2776-2783] identified n-vertex trees with given matching number q which simultaneously minimize all Laplacian coefficients. In this paper, we give another proof of this result. Generalizing the approach in the above paper, we determine n-vertex trees with given matching number q which have the second minimal Laplacian coefficients. We also identify the n-vertex trees with a perfect matching having the largest and the second largest Laplacian coefficients, respectively. Extremal values on some indices, such as Wiener index, modified hyper-Wiener index, Laplacian-like energy, incidence energy, of n-vertex trees with matching number q are obtained in this paper.     

Connected graphs with maximal Q-index: The one-dominating-vertex case

By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. For every pair of positive integers n,k, it is proved that if 3?k?n-3, then H_n,k, the graph obtained from the star K_1,n-1 by joining a vertex of degree 1 to k+1 other vertices of degree 1, is the unique connected graph that maximizes the largest signless Laplacian eigenvalue over all connected graphs with n vertices and n+k edges.     

Strongly irreducible ideals of a commutative ring

An ideal I of a ring R is said to be strongly irreducible if for ideals J and K of R, the inclusion J∩K⊆I implies that either J⊆I or K⊆I. The relationship among the families of irreducible ideals, strongly irreducible ideals, and prime ideals of a commutative ring R is considered, and a characterization is given of the Noetherian rings which contain a non-prime strongly irreducible ideal.     

A sharp upper bound on algebraic connectivity using domination number

Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the domination number. In this paper, we prove a sharp upper bound on the algebraic connectivity of a connected graph in terms of the domination number and characterize the associated extremal graphs.     

Spectral radius of digraphs with given dichromatic number

Let D be a digraph with vertex set V(D). A partition of V(D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number χ(D) of the digraph D. Denote G_n,k the set of the digraphs of order n with the dichromatic number k≥2. In this note, we characterize the digraph which has the maximal spectral radius in G_n,k. Our result generalizes the result of [8] by Feng et al.     

On the Estrada and Laplacian Estrada indices of graphs

The Estrada index of a graph G is defined as , where λ₁,λ₂,…,λ_n are the eigenvalues of G. The Laplacian Estrada index of a graph G is defined as , where μ₁,μ₂,…,μ_n are the Laplacian eigenvalues of G. An edge grafting operation on a graph moves a pendent edge between two pendent paths. We study the change of Estrada index of graph under edge grafting operation between two pendent paths at two adjacent vertices. As the application, we give the result on the change of Laplacian Estrada index of bipartite graph under edge grafting operation between two pendent paths at the same vertex. We also determine the unique tree with minimum Laplacian Estrada index among the set of trees with given maximum degree, and the unique trees with maximum Laplacian Estrada indices among the set of trees with given diameter, number of pendent vertices, matching number, independence number and domination number, respectively.     

The Poincaré series of multiplier ideals of a simple complete ideal in a local ring of a smooth surface

For a simple complete ideal ℘ of a local ring at a closed point on a smooth complex algebraic surface, we introduce an algebraic object, named Poincaré series P_℘, that gathers in a unified way the jumping numbers and the dimensions of the vector space quotients given by consecutive multiplier ideals attached to ℘. This paper is devoted to prove that P_℘ is a rational function giving an explicit expression for it.