Minimizing the least eigenvalue of unicyclic graphs with fixed diameter

Let U(n,d) be the set of unicyclic graphs on n vertices with diameter d. In this article, we determine the unique graph with minimal least eigenvalue among all graphs in U(n,d). It is found that the extremal graph is different from that for the corresponding problem on maximal eigenvalue as done by Liu et al. [H.Q. Liu, M. Lu, F. Tian, On the spectral radius of unicyclic graphs with fixed diameter, Linear Algebra Appl. 420 (2007) 449-457].     

The smallest values of algebraic connectivity for unicyclic graphs

The algebraic connectivity of G is the second smallest eigenvalue of its Laplacian matrix. Let U_n be the set of all unicyclic graphs of order n. In this paper, we will provide the ordering of unicyclic graphs in U_n up to the last seven graphs according to their algebraic connectivities when n≥13. This extends the results of Liu and Liu [Y. Liu, Y. Liu, The ordering of unicyclic graphs with the smallest algebraic connectivity, Discrete Math. 309 (2009) 4315-4325] and Guo [J.-M. Guo, A conjecture on the algebraic connectivity of connected graphs with fixed girth, Discrete Math. 308 (2008) 5702-5711].     

Functional convergence of stochastic integrals with application to statistical inference

Assuming that {(U_n,V_n)} is a sequence of càdlàg processes converging in distribution to (U,V) in the Skorohod topology, conditions are given under which {?f_n(β,u,v)dU_ndV_n} converges weakly to ?f(β,x,y)dUdV in the space C(R), where f_n(β,u,v) is a sequence of “smooth” functions converging to f(β,u,v). Integrals of this form arise as the objective function for inference about a parameter β in a stochastic model. Convergence of these integrals play a key role in describing the asymptotics of the estimator of β which optimizes the objective function. We illustrate this with a moving average process.     

Some results on Laplacian spectral radius of graphs with cut vertices

In this paper, we give some results on Laplacian spectral radius of graphs with cut vertices, and as their applications, we also determine the unique graph with the largest Laplacian spectral radius among all unicyclic graphs with n vertices and diameter d, 3?d?n−3.     

LARGEST EIGENVALUE OF A UNICYCLIC MIXED GRAPH

The graphs which maximize and minimize respectively the largest eigenvalue over all unicyclic mixed graphs U on n vertices are determined. The unicyclic mixed graphs U with the largest eigenvalue λ1 (U)=n or λ1 (U)∈ (n ,n 1] are characterized.     

Lucas sequences and quadratic orders

We consider the Lucas sequences (U _n ) _{n ≥ 0} defined by U ₀ = 0, U ₁ = 1, and U _n =  PU _n–1 – QU _n–2 for non-zero integral parameters P, Q such that Δ = P ² – 4Q is not a square. We use the arithmetic of the quadratic order with discriminant Δ to investigate the zeros and the period length of the sequence (U _n ) _{n ≥ 0} modulo a positive integer d coprime to Q. For a prime p not dividing Q, we give precise formulas for p-powers, we determine the p-adic value of U _n , and we connect the results with class number relations for quadratic orders.     

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on n vertices with girth g (n, g being fixed), which graph minimizes the Laplacian spectral radius? Let U _n,g be the lollipop graph obtained by appending a pendent vertex of a path on n ? g (n > g) vertices to a vertex of a cycle on g ? 3 vertices. We prove that the graph U _n,g uniquely minimizes the Laplacian spectral radius for n ? 2g ? 1 when g is even and for n ? 3g ? 1 when g is odd.     

On the multiplicity of Laplacian eigenvalues for unicyclic graphs

Let G be a connected graph of order n and U a unicyclic graph with the same order. We firstly give a sharp bound for m_G(μ), the multiplicity of a Laplacian eigenvalue μ of G. As a straightforward result, m_U(1) ? n ? 2. We then provide two graph operations (i.e., grafting and shifting) on graph G for which the value of m_G(1) is nondecreasing. As applications, we get the distribution of m_U (1) for unicyclic graphs on n vertices. Moreover, for the two largest possible values of m_U(1) ∈ {n ? 5, n ? 3}, the corresponding graphs U are completely determined.

     

A short and unified proof of Yu et al.?s two results on the eccentric distance sum

The eccentric distance sum (EDS) is a novel topological index that offers a vast potential for structure activity/property relationships. For a connected graph G, the eccentric distance sum is defined as ξd(G)=_∑v∈V(G)ecG(v)DG(v), where ecG(v) is the eccentricity of a vertex v in G and DG(v) is the sum of distances of all vertices in G from v. More recently, Yu et al. [G. Yu, L. Feng, A. Ili?, On the eccentric distance sum of trees and unicyclic graphs, J. Math. Anal. Appl. 375 (2011) 99-107] proved that for an n-vertex tree T, ξd(T)?4n²−9n+5, with equality holding if and only if T is the n-vertex star Sn, and for an n-vertex unicyclic graph G, ξd(G)?4n²−9n+1, with equality holding if and only if G is the graph obtained by adding an edge between two pendent vertices of n-vertex star. In this note, we give a short and unified proof of the above two results.     

On squares in Lucas sequences

Let P and Q be non-zero integers. The Lucas sequence {Un(P,Q)} is defined by U₀=0, U₁=1, Un=PUn−1−QUn−2 (n?2). The question of when Un(P,Q) can be a perfect square has generated interest in the literature. We show that for n=2,…,7, Un is a square for infinitely many pairs (P,Q) with gcd(P,Q)=1; further, for n=8,…,12, the only non-degenerate sequences where gcd(P,Q)=1 and Un(P,Q)=□, are given by U₈(1,−4)=²¹², U₈(4,−17)=⁶²⁰², and U₁₂(1,−1)=¹²².     

Degree Distance of Unicyclic Graphs with Given Matching Number

Let G be a connected graph with vertex set V(G). The degree distance of G is defined as ${D'(G) = \sum_{\{u, v\}\subseteq V(G)} (d_G(u) + d_G (v))\, d(u,v)}$ , where d _G (u) is the degree of vertex u, d(u, v) denotes the distance between u and v, and the summation goes over all pairs of vertices in G. In this paper, we characterize n-vertex unicyclic graphs with given matching number and minimal degree distance.     

On the log-concavity of Hilbert series of Veronese subrings and Ehrhart series

For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write ${\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}}For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write \frach(t)(1 - t)^{d + 1}=?_{m 3 0} g(m)  t^m{\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}} , for some polynomial g(m) with rational coefficients, then \fracU_nh(t)(1- t)^d+1 = ?_{m 3 0}g(nm)  t^m{\frac{{\rm{U}}_{n}h(t)}{(1- t)^{d+1}} = \sum_{m \geq 0}g(nm) \, t^{m}} . We show that there exists a positive integer n _d , depending only on d, such that if h(t) is a polynomial of degree at most d with nonnegative integer coefficients and h(0) = 1, then for n ≥ n _d , U _n h(t) has simple, real, negative roots and positive, strictly log concave and strictly unimodal coefficients. Applications are given to Ehrhart δ-polynomials and unimodular triangulations of dilations of lattice polytopes, as well as Hilbert series of Veronese subrings of Cohen–Macauley graded rings.     

On the eccentric distance sum of trees and unicyclic graphs

Let G be a simple connected graph with the vertex set V(G). The eccentric distance sum of G is defined as ξd(G)=_∑v∈V(G)ε(v)DG(v), where ε(v) is the eccentricity of the vertex v and DG(v)=_∑u∈V(G)d(u,v) is the sum of all distances from the vertex v. In this paper we characterize the extremal unicyclic graphs among n-vertex unicyclic graphs with given girth having the minimal and second minimal eccentric distance sum. In addition, we characterize the extremal trees with given diameter and minimal eccentric distance sum.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

The Laplacian spread of quasi-tree graphs

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. Bao, Tan and Fan [Y.H. Bao, Y.Y. Tan,Y.Z. Fan, The Laplacian spread of unicyclic graphs, Appl. Math. Lett. 22 (2009) 1011-1015.] characterize the unique unicyclic graph with maximum Laplacian spread among all connected unicyclic graphs of fixed order. In this paper, we characterize the unique quasi-tree graph with maximum Laplacian spread among all quasi-tree graphs in the set Q(n,d) with .     

On a dual submanifold homomorphism

In this paper we develop a technique to study the homomorphisma: MU _* (B U₁)→M U_*?2 (B U₁) defined by assigning to the class off: M→B U ₁ the class off _oi: N→B U₁, wherei: N→M is the submanifold dual tof*(γ₁)?f*(γ₁), and γ₁→B U is the 3 universal line boundle. So that we can present a (σ_n), where σ_nis the class of the classifying map of the canonical line boundle overC P ⁿ, in terms of the σ_i’s and chosen generators of Π_★(M U).     

Harmonic analysis on unitary groups

A theory of harmonic analysis on a metric group (G, d) is developed with the model of U$\text{U}$, the unitary group of a C¹-algebra $\text{U}$, in mind. Essential in this development is the set $\text{G}\text{?}{}_{\mathrm{d}}$ of contractive, irreducible representations of G, and its concomitant set P_d(G) of positive-definite functions. It is shown that $\text{G}\text{?}{}_{\mathrm{d}}$ is compact and closed in $\text{G}\text{?}$. The set $\text{G}\text{?}{}_{\mathrm{d}}$ is determined in a number of cases, in particular when G = U($\text{U}$) with $\text{U}$ abelian. If $\text{U}$ is an AW¹-algebra, it is shown that $\text{G}\text{?}$_d is essentially the same as $\text{U}\text{?}$. Unitary groups are characterised in terms of a certain Lie algebra $\text{g}$_u and several characterisations of G = U($\text{U}$) when $\text{U}$ is abelian are given.