相关论文: Bond Incident Degree (BID) Indices of Polyomino Ch…

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…

We propose a new method to estimate the critical index $t$ for strength of networks of random fused conductors. It relies on a recently introduced expression for their yield strength. We confirm the results using finite size scaling. To…

There are various topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. These topological indices correlate certain physicochemical properties such as…

The zeroth-order general Randi\'c index (usually denoted by $R_{\alpha}^{0}$) and variable sum exdeg index (denoted by $SEI_{a}$) of a graph $G$ are defined as $R_{\alpha}^{0}(G)= \sum_{v\in V(G)} (d_{v})^{\alpha}$ and $SEI_{a}(G)=…

We consider a Bayesian framework based on "probability of decision" for dose-finding trial designs. The proposed PoD-BIN design evaluates the posterior predictive probabilities of up-and-down decisions. In PoD-BIN, multiple grades of…

In unsupervised machine learning, agreement between partitions is commonly assessed with so-called external validity indices. Researchers tend to use and report indices that quantify agreement between two partitions for all clusters…

The extreme value index (EVI) characterizes the tail behavior of a distribution and is crucial for extreme value theory. Inference on the EVI is challenging due to data scarcity in the tail region. We propose a novel method for constructing…

Summary statistics play an important role in network data analysis. They can provide us with meaningful insight into the structure of a network. The Randi\'{c} index is one of the most popular network statistics that has been widely used…

We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy…

Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network constructed from $G$ by replacing each edge with a unit…

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.

Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…

This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…

Let $G=(V,E)$ be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as $ABC_{GG}(G)=\sum_{uv\in E(G)}\sqrt{\frac{n_u(uv,G)+n_v(uv,G)-2}{n_u(uv,G)n_v(uv,G)}},$ where $n_u(uv,G)$ is the number of vertices closer to…

In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Let $d_v$ be the degree of the vertex $v$ in a connected graph $G$. The first Banhatti-Sombor index of $G$ is defined as $BSO(G) =\sum_{uv\in E(G)}\sqrt{\frac{1}{d^2_u}+\frac{1}{d^2_v}}$, which is a new vertex-degree-based topological index…

This paper focuses on incidences over finite fields, extending to higher degrees a result by Vinh \cite{VINH20111177} on the number of point-line incidences in the plane $\mathbb{F}^2$, where $\mathbb{F}$ is a finite field. Specifically, we…