Distance and distance signless Laplacian spread of connected graphs

For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $\mathcal{Q}(G)=Tr(G)+\mathcal{D}(G)$, where $\mathcal{D}(G)$ is the distance matrix, $Tr(G)=diag(D_1, D_2, \ldots, D_n)$ and $D_{i}$ is the row sum of $\mathcal{D}(G)$ corresponding to vertex $v_{i}$. Denote by $\rho^{\mathcal{D}}(G),$ $\rho_{min}^{\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\mathcal{D}(G)$, respectively. And denote by $q^{\mathcal{D}}(G)$, $q_{min}^{\mathcal{D}}(G)$ the largest eigenvalue and the least eigenvalue of $\mathcal{Q}(G)$, respectively. The distance spread of a graph $G$ is defined as $S_{\mathcal{D}}(G)=\rho^{\mathcal{D}}(G)- \rho_{min}^{\mathcal{D}}(G)$, and the distance signless Laplacian spread of a graph $G$ is defined as $S_{\mathcal{Q}}(G)=q^{\mathcal{D}}(G)-q_{min}^{\mathcal{D}}(G)$. In this paper, we point out an error in the result of Theorem 2.4 in "Distance spectral spread of a graph" [G.L. Yu, et al, Discrete Applied Mathematics. 160 (2012) 2474--2478] and rectify it. As well, we obtain some lower bounds on ddistance signless Laplacian spread of a graph

The distinguishing index of graphs with at least one cycle is not more than its distinguishing number

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex (edge) labeling with $d$ labels that is preserved only by the trivial automorphism. It is known that for every graph $G$ we have $D'(G) \leq D(G) + 1$. The complete characterization of finite trees $T$ with $D'(T)=D(T)+ 1$ has been given recently. In this note we show that if $G$ is a finite connected graph with at least one cycle, then $D'(G)\leq D(G)$. Finally, we characterize all connected graphs for which $D'(G) \leq D(G)$

Distinguishing number and distinguishing index of some operations on graphs

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. We examine the effects on $D(G)$ and $D'(G)$ when $G$ is modified by operations on vertex and edge of $G$. Let $G$ be a connected graph of order $n\geq 3$. We show that $-1\leq D(G-v)-D(G)\leq D(G)$, where $G-v$ denotes the graph obtained from $G$ by removal of a vertex $v$ and all edges incident to $v$ and these inequalities are true for the distinguishing index. Also we prove that $|D(G-e)-D(G)|\leq 2$ and $-1 \leq D'(G-e)-D'(G)\leq 2$, where $G-e$ denotes the graph obtained from $G$ by simply removing the edge $e$. Finally we consider the vertex contraction and the edge contraction of $G$ and prove that the edge contraction decrease the distinguishing number (index) of $G$ by at most one and increase by at most $3D(G)$ ($3D'(G)$).Comment: 11 pages, 4 figure

On the second largest distance eigenvalue of a graph

Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\lambda_{1}(D(G))\geq\lambda_{2}(D(G))\geq\cdots\geq\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph with the same spectrum as $G$ is isomorphic to $G$. In this paper, we consider spectral characterization on the second largest distance eigenvalue $\lambda_{2}(D(G))$ of graphs, and prove that the graphs with $\lambda_{2}(D(G))\leq\frac{17-\sqrt{329}}{2}\approx-0.5692$ are determined by their $D$-spectra

On the lower bounds of Davenport constant

Let $G = C_{n_1} \oplus \cdots \oplus C_{n_r}$ with $1 < n_1 | \cdots | n_r$ be a finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. It is a starting point of zero-sum theory but only has a trivial lower bound $\mathsf D^*(G) = n_1 + \cdots + n_r - r + 1$, which equals $\mathsf D(G)$ over $p$-groups. We investigate the non-dispersive sequences over group $C_n^r$, thereby revealing the growth of $\mathsf D(G)-\mathsf D^*(G)$ over non-$p$-groups $G = C_n^r \oplus C_{kn}$ with $n,k \ne 1$. We give a general lower bound of $\mathsf D(G)$ over non-$p$-groups and show that, let $G$ be abelian groups with $\exp(G)=m$ and rank $r$, fix $m>0$ a non-prime-power, then for each $N>0$ there exists an $\varepsilon>0$ such that if $|G|/m^r<\varepsilon$, then $\mathsf D(G)-\mathsf D^*(G)>N$

Recurrence relations and splitting formulas for the domination polynomial

The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G,x) for arbitrary graphs and for various special cases. We give splitting formulas for D(G,x) based on articulation vertices, and more generally, on splitting sets of vertices

Jones type basic construction on field algebras of GG-spin models

Let $G$ be a finite group. Starting from the field algebra ${\mathcal{F}}$ of $G$-spin models, one can construct the crossed product $C^*$-algebra ${\mathcal{F}}\rtimes D(G)$ such that it coincides with the $C^*$-basic construction for the field algebra ${\mathcal{F}}$ and the $D(G)$-invariant subalgebra of ${\mathcal{F}}$, where $D(G)$ is the quantum double of $G$. Under the natural $\widehat{D(G)}$-module action on ${\mathcal{F}}\rtimes D(G)$,the iterated crossed product $C^*$-algebra can be obtained, which is $C^*$-isomorphic to the $C^*$-basic construction for ${\mathcal{F}}\rtimes D(G)$ and the field algebra ${\mathcal{F}}$. Furthermore, one can show that the iterated crossed product $C^*$-algebra is a new field algebra and give the concrete structure with the order and disorder operators.Comment: 14 page

Introduction to Domination Polynomial of a Graph

We introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number of dominating sets of G of size i. We obtain some properties of D(G, x) and its coefficients. Also we compute this polynomial for some specific graphs.Comment: 10 pages. Accepted http://www.combinatorialmath.ca/ArsCombinatoria/index.htm

New skew Laplacian energy of a simple digraph

For a simple digraph $G$ of order $n$ with vertex set $\{v_1,v_2,\ldots, v_n\}$, let $d_i^+$ and $d_i^-$ denote the out-degree and in-degree of a vertex $v_i$ in $G$, respectively. Let $D^+(G)=diag(d_1^+,d_2^+,\ldots,d_n^+)$ and $D^-(G)=diag(d_1^-,d_2^-,\ldots,d_n^-)$. In this paper we introduce $\widetilde{SL}(G)=\widetilde{D}(G)-S(G)$ to be a new kind of skew Laplacian matrix of $G$, where $\widetilde{D}(G)=D^+(G)-D^-(G)$ and $S(G)$ is the skew-adjacency matrix of $G$, and from which we define the skew Laplacian energy $SLE(G)$ of $G$ as the sum of the norms of all the eigenvalues of $\widetilde{SL}(G)$. Some lower and upper bounds of the new skew Laplacian energy are derived and the digraphs attaining these bounds are also determined.Comment: 13 page

Irreducibility and components rigid in moduli of the Hilbert scheme of smooth curves

Denote by $\mathcal{H}_{d,g,r}$ the Hilbert scheme of smooth curves, that is the union of components whose general point corresponds to a smooth irreducible and non-degenerate curve of degree $d$ and genus $g$ in $\mathbb P^r$. A component of $\mathcal{H}_{d,g,r}$ is rigid in moduli if its image under the natural map $\pi:\mathcal{H}_{d,g,r} \dashrightarrow \mathcal{M}_{g}$ is a one point set. In this note, we provide a proof of the fact that $\mathcal{H}_{d,g,r}$ has no components rigid in moduli for $g > 0$ and $r=3$, from which it follows that the only smooth projective curves embedded in $\mathbb P^3$ whose only deformations are given by projective transformations are the twisted cubic curves. In case $r \geq 4$, we also prove the non-existence of a component of $\mathcal{H}_{d,g,r}$ rigid in moduli in a certain restricted range of $d$, $g>0$ and $r$. In the course of the proofs, we establish the irreducibility of $\mathcal{H}_{d,g,3}$ beyond the range which has been known before.Comment: v2: added (ii) in Cor. 3.6; v3: minor typos correcte