Mar 1, 2016 · In this paper, we completely determine the extremal graphs with the largest and smallest vertex PI indices among all the cacti. As a consequence ...
Missing: Uniform | Show results with:Uniform
The Wiener index W(G) of a connected graph G is the sum of distances between all pairs of vertices of G. A connected graph G is said to be a cactus if each ...
Jun 15, 2023 · In this paper, we give some transformations which decrease or increase the eccentric connectivity index of hyper-cacti.
In this section, we derive the extremal cacti for the Wiener index, Merrifield-. Simmons index, Hosoya index and spectral radius by a unified approach. In [3] ...
Missing: Uniform | Show results with:Uniform
In this paper we characterize the chain hexagonal cactus with the minimal and the maximal eccentric distance sum among all chain hexagonal cacti of length n, ...
In this paper, we partake figured the F -index of triangular cactus manacles, tetragonal cactus restraints, hexagonal cactus restraints and the polyomino ...
In this paper, we characterize n-vertex cyclic cactus with given matching number m which minimizes the distance spectral radius. The resulting cactus also ...
Mar 15, 2022 · We propose some hypergraph transformations that increase or decrease the eccentric connectivity index of a uniform hypergraph.
Feb 27, 2014 · In this paper, we discuss the extremal graphs of Wiener polarity index of cycle-block graphs with g ≥ 5 and 4-uniform cactus. 2. The Extremal ...
Mar 1, 2013 · In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti.