相关论文: Asymptotic distribution of degree--based topologic…

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

Let $A$ be the (rescaled) adjacency matrix of the Erd\H{o}s-R\'enyi graphs $\cal G(N,p)$. For $N^{-1+\tau} \leqslant p\leqslant N^{-\tau}$, we study the fluctuation of $f(A)_{ii}$ on the global and mesoscopic spectral scales. We show that…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights, and are such that the degree of…

We propose a method to associate a differentiable Riemannian manifold to a generic many degrees of freedom discrete system which is not described by a Hamiltonian function. Then, in analogy with classical Statistical Mechanics, we introduce…

Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a…

Trophic coherence, a measure of a graph's hierarchical organisation, has been shown to be linked to a graph's structural and dynamical aspects such as cyclicity, stability and normality. Trophic levels of vertices can reveal their…

We study the properties of $\Phi$-irregular sets (sets of points for which the Birkhoff average diverges) in dynamical systems with the shadowing property. We estimate the topological entropy of $\Phi$-irregular set in terms of entropy on…

The forgotten topological index of a graph $G$, denoted by $F(G)$, is defined as the sum of weights $d(u)^{2}+d(v)^{2}$ over all edges $uv$ of $G$ , where $d(u)$ denotes the degree of a vertex $u$. In this paper, we give sharp upper bounds…

We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…

Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…

The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets…

We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…

Haros graphs is a graph-theoretical representation of real numbers in the unit interval. The degree distribution of the Haros graphs provides information regarding the topological structure and the associated real number. This article…

The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…

In 1980, Ajtai, Komlos and Szemer{\'e}di defined "groupie": Let $G=(V,E)$ be a simple graph, $|V|=n$, $|E|=e$. For a vertex $v\in V$, let $r(v)$ denote the sum of the degrees of the vertices adjacent to $v$. We say $v\in V$ is a {\it…

In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…