Let $G$ be a connected graph with vertex set $V\left(G\right)=\{v_1,v_2,...,v_n\}$. The distance matrix $D\left(G\right)={\left(d_{ij}\right)}_{n\times n}$ is the matrix indexed by the vertices of $G$, where $d_{ij}$ denotes the distance between the vertices $v_i$ and $v_j$. Suppose that ${\lambda }_1\left(D\right)\ge {\lambda }_2\left(D\right)\ge \cdots \ge {\lambda }_n\left(D\right)$ are the distance spectrum of $G$. The graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D\left(G\right)$, any graph having the same spectrum as $G$ is isomorphic to $G$. We give the distance characteristic polynomial of some graphs with small diameter, and also prove that these graphs...

We give a necessary and a sufficient condition for a subset $S$ of a locally convex Waelbroeck algebra $𝒜$ to have a non-void left joint spectrum ${\sigma }_l\left(S\right).$ In particular, for a Lie subalgebra $L\subset 𝒜$ we have ${\sigma }_l\left(L\right)\ne \varnothing$ if and only if $[L,L]$ generates in $𝒜$ a proper left ideal. We also obtain a version of the spectral mapping formula for a modified left joint spectrum. Analogous theorems for the right joint spectrum and the Harte spectrum are also valid.

An infinite set A in a space X converges to a point p (denoted by A → p) if for every neighbourhood U of p we have |A∖U| < |A|. We call cS(p,X) = |A|: A ⊂ X and A → p the convergence spectrum of p in X and cS(X) = ⋃cS(x,X): x ∈ X the convergence spectrum of X. The character spectrum of a point p ∈ X is χS(p,X) = χ(p,Y): p is non-isolated in Y ⊂ X, and χS(X) = ⋃χS(x,X): x ∈ X is the character spectrum of X. If κ ∈ χS(p,X) for a compactum X then κ,cf(κ) ⊂ cS(p,X). A selection of our...

We consider simultaneous solutions of operator Sylvester equations $A_{i}X-X{B}_i=C_i$ (1 ≤ i ≤ k), where $(A₁,...,A_k)$ and $(B₁,...,B_k)$ are commuting k-tuples of bounded linear operators on Banach spaces and ℱ, respectively, and $(C₁,...,C_k)$ is a (compatible) k-tuple of bounded linear operators from ℱ to , and prove that if the joint Taylor spectra of $(A₁,...,A_k)$ and $(B₁,...,B_k)$ do not intersect, then this system of Sylvester equations has a unique simultaneous solution.

For a linear operator T in a Banach space let ${\sigma }_p\left(T\right)$ denote the point spectrum of T, let ${\sigma }_{p,n}\left(T\right)$ for finite n > 0 be the set of all $\lambda \in {\sigma }_p\left(T\right)$ such that dim ker(T - λ) = n and let ${\sigma }_{p,\infty }\left(T\right)$ be the set of all $\lambda \in {\sigma }_p\left(T\right)$ for which ker(T - λ) is infinite-dimensional. It is shown that ${\sigma }_p\left(T\right)$ is ${ℱ}_{\sigma }$, ${\sigma }_{p,\infty }\left(T\right)$ is ${ℱ}_{\sigma \delta }$ and for each finite n the set ${\sigma }_{p,n}\left(T\right)$ is the intersection of an ${ℱ}_{\sigma }$ set and a ${}_{\delta }$ set provided T is closable and the domain of T is separable and weakly σ-compact. For closed densely defined operators in a separable Hilbert space a more...

Let $T_1,\cdots ,T_d$ be homogeneous trees with degrees $q_1+1,\cdots ,q_d+1\ge 3$, respectively. For each tree, let $𝔥:T_j\to \mathbb{Z}$ be the Busemann function with respect to a fixed boundary point (end). Its level sets are the horocycles. The horocyclic product of $T_1,\cdots ,T_d$ is the graph $\mathrm{𝖣𝖫}(q_1,\cdots ,q_d)$ consisting of all $d$-tuples $x_1\cdots x_d\in T_1\times \cdots \times T_d$ with $𝔥\left(x_1\right)+\cdots +𝔥\left(x_d\right)=0$, equipped with a natural neighbourhood relation. In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. If $d=2$ and $q_1=q_2=q$ then we obtain a Cayley graph...

Given a graph $G$, if there is no nonisomorphic graph $H$ such that $G$ and $H$ have the same signless Laplacian spectra, then we say that $G$ is $Q$-DS. In this paper we show that every fan graph $F_n$ is $Q$-DS, where $F_n=K_1\vee P_{n-1}$ and $n\ge 3$.

For a connected graph $G=(V,E)$ and a set $S\subseteq V\left(G\right)$ with at least two vertices, an $S$-Steiner tree is a subgraph $T=(V^{\text{'}},E^{\text{'}})$ of $G$ that is a tree with $S\subseteq V^{\text{'}}$. If the degree of each vertex of $S$ in $T$ is equal to 1, then $T$ is called a pendant $S$-Steiner tree. Two $S$-Steiner trees are if they share no vertices other than $S$ and have no edges in common. For $S\subseteq V\left(G\right)$ and $\left|S\right|\ge 2$, the pendant tree-connectivity ${\tau }_G\left(S\right)$ is the maximum number of internally disjoint pendant $S$-Steiner trees in $G$, and for $k\ge 2$, the $k$-pendant tree-connectivity ${\tau }_k\left(G\right)$ is the...

A graph $G$ is a $k$-tree if either $G$ is the complete graph on $k+1$ vertices, or $G$ has a vertex $v$ whose neighborhood is a clique of order $k$ and the graph obtained by removing $v$ from $G$ is also a $k$-tree. Clearly, a $k$-tree has at least $k+1$ vertices, and $G$ is a 1-tree (usual tree) if and only if it is a $1$-connected graph and has no $K_3$-minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of $k$-trees as follows: if $G$ is a graph with at least $k+1$ vertices, then $G$ is...

First, some classic properties of a weighted Frobenius-Perron operator ${𝒫}_{\varphi }^u$ on $L^1\left(\Sigma \right)$ as a predual of weighted Koopman operator $W=u{U}_{\varphi }$ on $L^{\infty }\left(\Sigma \right)$ will be investigated using the language of the conditional expectation operator. Also, we determine the spectrum of ${𝒫}_{\varphi }^u$ under certain conditions.

In this paper, we study the size of the giant component $C_G$ in the random geometric graph $G=G(n,r_n,f)$ of $n$ nodes independently distributed each according to a certain density $f(·)$ in ${[0,1]}^2$ satisfying ${inf}_{x\in {[0,1]}^2}f\left(x\right)gt;$ $0$. If $\frac{c_1}{n}\le r_n^2\le c_2\frac{logn}{n}$ for some positive constants $c_1$, $c_2$ and $n{r}_n^2⟶\infty$ as $n\to \infty$, we show that the giant component of $G$ contains at least $n-\mathrm{o}\left(n\right)$ nodes with probability at least $1-{\mathrm{e}}^{-\beta n{r}_n^2}$ for all $n$ and for some positive constant $\beta$. We also obtain estimates on the diameter and number of the non-giant components of $G$.

We study the stability of a-Browder-type theorems for orthogonal direct sums of operators. We give counterexamples which show that in general the properties $\left(\mathrm{SBaw}\right)$, $\left(\mathrm{SBab}\right)$, $\left(\mathrm{SBw}\right)$ and $\left(\mathrm{SBb}\right)$ are not preserved under direct sums of operators. However, we prove that if $S$ and $T$ are bounded linear operators acting on Banach spaces and having the property $\left(\mathrm{SBab}\right)$, then $S\oplus T$ has the property $\left(\mathrm{SBab}\right)$ if and only if ${\sigma }_{{\mathrm{SBF}}_{+}^{-}}(S\oplus T)={\sigma }_{{\mathrm{SBF}}_{+}^{-}}\left(S\right)\cup {\sigma }_{{\mathrm{SBF}}_{+}^{-}}\left(T\right)$, where ${\sigma }_{{\mathrm{SBF}}_{+}^{-}}\left(T\right)$ is the upper semi-B-Weyl spectrum of $T$. We obtain analogous preservation results for the properties $\left(\mathrm{SBaw}\right)$,...

Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d.$ Lesniak (1975) gave the lower bound $B(n,d)=\lceil 2(n-1)/d\rceil$ for $L(n,d).$ When $d$ is even, $B(n,d)=L(n,d).$ But when $d$ is odd, $B(n,d)$ is smaller than $L(n,d)$ in general. For example, $B(21,3)=14$ while $L(21,3)=19.$ In this note, we determine $L(n,d)$ using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.

Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → 0,1,2,...,m that induces a labeling f’: E(G) → 1,2,...,m of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is $val\left(f\right)={\Sigma }_{e\in E\left(G\right)}{f}^{\text{'}}K\left(e\right)$. The maximum value of a γ-labeling of G is defined as $va{l}_{max}\left(G\right)=maxval\left(f\right):fisa\gamma -labelingofG$; while the minimum value of a γ-labeling of G is $va{l}_{min}\left(G\right)=minval\left(f\right):fisa\gamma -labelingofG$; The values $va{l}_{max}\left(S_{p,q}\right)$ and $va{l}_{min}\left(S_{p,q}\right)$ are determined for double stars $S_{p,q}$. We present characterizations of connected graphs G of order n for which...