相关论文: Topological Indices Among Strong Support Vertex

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…

For an undirected tree with $n$ edges labelled by single letters, we consider its substrings, which are labels of the simple paths between pairs of nodes. We prove that there are $O(n^{1.5})$ different palindromic substrings. This solves an…

A stable set in a graph G is a set of mutually non-adjacent vertices, alpha(G) is the size of a maximum stable set of G, and core(G) is the intersection of all its maximum stable sets. In this paper we demonstrate that in a tree T, of order…

We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…

The strong vertex (edge) span of a given graph $G$ is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of $G$ and moving either to an adjacent vertex or staying in the current position…

Identification of a non-trivial $\mathbb{Z}_{2}$ index in a spinful two dimensional insulator indicates the presence of an odd, quantized (pseudo)spin-resolved Chern number, $C_{s}=(C_{\uparrow}-C_{\downarrow})/2$. However, the statement is…

We present results about the Cantor-Bendixson index of some subspaces of a uniform family F of finite subsets of natural numbers with respect to the lexicographic order topology. As a corollary of our results we get that for any…

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…

A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…

The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree $T$, let $p^{(k)}_1(T)$ be the proportion of paths among all $k$-vertex subtrees (induced…

We introduce the topologically twisted index for four-dimensional $\mathcal N=1$ gauge theories quantized on ${\rm AdS}_2 \times S^1$. We compute the index by applying supersymmetric localization to partition functions of vector and chiral…

The Steiner $k$-eccentricity of a vertex in graph $G$ is the maximum Steiner distance over all $k$-subsets containing the vertex. %Some general properties of the Steiner 3-eccentricity of trees are given. Let $\mathbb{T}_n$ be the set of…

This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…

This paper proposes a quantitative description of the low energy edge states at the interface between two-dimensional topological insulators. They are modeled by continuous Hamiltonians as systems of Dirac equations that are amenable to a…

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…

Though symmetry-based indicators formulae are powerful in diagnosing topological states with a gapped band structure at/between any high-symmetry points, it fails in diagnosing topological degeneracies when the compatibility condition is…

Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices…

We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $\alpha$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the…