Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.13468

Peripheral hyper-Wiener index of a graph

Andry N. Rabenantoandro
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this note, we introduce a new topological index of a graph G that we term peripheral hyper-Wiener index, denoted PWW(G). It is a natural extension of the peripheral Wiener index PW(G) initiated in [NB17] and is to the peripheral Wiener index what the hyper-Wiener index is to the Wiener index. We investigate its basic properties. We compute the peripheral hyper-Wiener index of the cartesian product and trees. In particular, we get an explicit formula for the case of the hypercubes. We also give lower and upper bounds on PW(G) and PWW(G) in terms of the order, size, diameter and the number of peripheral vertices. This paper is an echo to [NB17], most of the results we get are analogues of the ones therein.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andry N. Rabenantoandro. 2025-12-15. Peripheral hyper-Wiener index of a graph. https://arxiv.org/abs/2512.13468

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗