Related papers: On general Sombor index
Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$.…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
This paper presents the equality of finite index sums of Bessel func- tions containing arbitrary numbers of terms. These reduce to the familiar three term recursion formulas in simple cases.
We statistically compare the relationships between frequencies of digits in continued fraction expansions of typical rational points in the unit interval and higher dimensional generalisations. This takes the form of a Large Deviation and…
In this paper we present the super connectivity of Kronecker product of a general graph and a complete graph.
We examine the chromatic index of generalized truncations of graphs and multigraphs.
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an…
Eigenvalues of a graph are the eigenvalues of the corresponding (0,1)-adjacency matrix. The second largest eigenvalue lambda_2 provides significant information on characteristics and structure of graphs. Therefore, finding bounds for…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
The $\delta$-complement $G_\delta$ of a graph $G$, introduced in 2022 by Pai et al., is a variant of the graph complement, where two vertices are adjacent in $G_\delta$ if and only if they are of the same degree but not adjacent in $G$ or…
I consider general reflection coefficients for arbitrary one-dimensional whole line differential or difference operators of order $2$. These reflection coefficients are semicontinuous functions of the operator: their absolute value can only…
Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
Let G = G(V,E) be a graph with | V | vertices and | E | edges and total graph, T(G) is obtained from G. In This paper we have study the Harmonic index of total graph for standards graphs, bipartite graph of particular type, regular graph,…
Terpai [22] proved the Nordhaus-Gaddum bound that $\mu(G) + \mu(\overline{G}) \le 4n/3 - 1$, where $\mu(G)$ is the spectral radius of a graph $G$ with $n$ vertices. Let $s^+$ denote the sum of the squares of the positive eigenvalues of $G$.…
Recent work has generalized the Furstenberg correspondence between sets of integers and dynamical systems to versions which involve sequences of finite graphs or sequences of $L^\infty$ functions. We give a unified version of the theorem…
We investigate the paramater of the average range of $M$-Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this…
We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…