Zobrazeno 1 - 10
of 581
pro vyhledávání: '"05c09"'
Autor:
Gao, Jeffrey, Kainen, Paul C.
A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity cost} for
Externí odkaz:
http://arxiv.org/abs/2412.00212
Autor:
Dankelmann, Peter
In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most generalisations of the W
Externí odkaz:
http://arxiv.org/abs/2411.13439
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss numerical results.
Externí odkaz:
http://arxiv.org/abs/2411.05513
The $\sigma_{t}$-irregularity (or sigma total index) is a graph invariant which is defined as $\sigma_{t}(G)=\sum_{\{u,v\}\subseteq V(G)}(d(u)-d(v))^{2},$ where $d(z)$ denotes the degree of $z$. This irregularity measure was proposed by R\' {e}ti [Ap
Externí odkaz:
http://arxiv.org/abs/2411.04881
Let $\eta_{1}\ge \eta_{2}\ge\cdots\ge \eta_{n}$ be the eigenavalues of $\mathcal{ABS}$ matrix. In this paper, we characterize connected graphs with $\mathcal{ABS}$ eigenvalue $\eta_{n}>-1$. As a result, we determine all connected graphs with exactly
Externí odkaz:
http://arxiv.org/abs/2409.03287
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. Ghorbani
Externí odkaz:
http://arxiv.org/abs/2408.05424
Autor:
Sorgun, Sezer, Birgin, Kahraman
Quantitative Structure-Property Relationship (QSPR) analysis plays a crucial role in predicting physicochemical properties and biological activities of pharmaceutical compounds, aiding in drug design and optimization. This study focuses on leveraging
Externí odkaz:
http://arxiv.org/abs/2408.06367
We define various notions of energy of a set of vertices in a graph, which generalize two of the most widely studied graphical indices: the Wiener index and the Harary index. We prove several theorems indicating that these notions of energy can be us
Externí odkaz:
http://arxiv.org/abs/2407.18785
Autor:
Pandey, Dinesh
The distance of a vertex in a graph is the sum of distances from that vertex to all other vertices of the graph. The Wiener index of a graph is the sum of distances between all its unordered pairs of vertices. A graph has been obtained that contains
Externí odkaz:
http://arxiv.org/abs/2407.10288
Autor:
Cambie, Stijn
We explore the question asking for graphs $G$ for which the total distance decreases, possibly by a fixed constant $k$, upon the removal of any of its vertices. We obtain results leading to intuition and doubts for the \v{S}olt\'es' problem ($k=0$) a
Externí odkaz:
http://arxiv.org/abs/2406.03451