相关论文: On general Sombor index
Gcd-graphs represent an interesting and historically important class of integral graphs. Since the pioneering work of Klotz and Sander, numerous incarnations of these graphs have been explored in the literature. In this article, we define…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
Core-satellite graphs (sometimes referred to as generalized friendship graphs) are an interesting class of graphs that generalize many well known types of graphs. In this paper we show that two popular clustering measures, the average…
The notion of a generalized scale emerged in recent joint work with Afsar-Brownlowe-Larsen on equilibrium states on C*-algebras of right LCM monoids, where it features as the key datum for the dynamics under investigation. This work…
We generalize the winding number formula for the Fredholm index of a Toeplitz operator to the Witten index. We also show trace formulae involving Toeplitz operators and operator monotone functions.
Three categories of algebras with morphisms generalising the usual set of algebra homomorphisms are described. The Sweedler product provides a hom-tensor equivalence relating these three categories, and a tool enabling the universal…
We consider topological indices I that are sums of f(deg(u)) f(deg(v)), where {u,v} are adjacent vertices and f is a function. The Randi{\'c} connectivity index or the Zagreb group index are examples for indices of this kind. In earlier…
The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized…
The general sum-connectivity index of a graph $G$ is defined as $\chi_{\alpha}(G)= \sum_{uv\in E(G)} (d_u + d_{v})^{\alpha}$ where $d_{u}$ is degree of the vertex $u\in V(G)$, $\alpha$ is a real number different from $0$ and $uv$ is the…
In this paper, we investigate the Diminished Sombor index (DSO), a recently introduced degree-based topological index for a simple graph $G$, defined as \[ DSO(G) = \sum_{uv \in E} \frac{\sqrt{d_u^2+d_v^2}}{d_u+d_v}, \] where $d_u$ denotes…
In this paper, we consider a regression model built on dependent variables. This regression modelizes an input output relationship. Under boundedness assumptions on the joint distribution function of the input variables, we show that a…
A $k$-decomposition $(G_1,\dots,G_k)$ of a graph $G$ is a partition of its edge set into $k$ spanning subgraphs $G_1,\dots,G_k$. The classical theorem of Nordhaus and Gaddum bounds $\chi(G_1) + \chi(G_2)$ and $\chi(G_1) \chi(G_2)$ over all…
Firstly, this paper establishes useful forms of the remainder term of Hardy-type inequalities on general domains where the weights are functions of the distance to the boundary. For weakly mean convex domains we use the resulting identities…
We use a graph-theoretic approach which yields improvements on the known Gilbert-Varshamov (GV) bound for sum-rank-metric codes for certain parameters. In particular, we show that asymptotically $\mathbb{F}_q^{\mathbf{n} \times \mathbf{m}}$…
This paper extends the idea of a generalized estimator for a scalar parameter (Vos, 2022) to multi-dimensional parameters both with and without nuisance parameters. The title reflects the fact that generalized estimators provide more than…
In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…
The Sombor index, a degree-based topological descriptor introduced by Gutman in 2021, lacks closed-form expressions for complex hierarchical trees with multi-level pendant structures and nonuniform degree distributions, despite extensive…
Traditional statistical learning theory relies on the assumption that data are identically and independently distributed (i.i.d.). However, this assumption often does not hold in many real-life applications. In this survey, we explore…
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
The Randi\'{c} index $R(G)$ of a graph $G$ is defined as the sum of $(d_i d_j)^{-1/2}$ over all edges $v_i v_j$ of $G$, where $d_i$ is the degree of the vertex $v_i$ in $G$. The radius $r(G)$ of a graph $G$ is the minimum graph eccentricity…