Results 21 to 30 of about 28,315 (192)

Five results on maximizing topological indices in graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj   +1 more source

The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics, 2023
The undirected P(Zₙ) power graph of a finite group of Zₙ is a connected graph, the set of vertices of which is Zₙ. Here u,v∈P(Zₙ) are two diverse adjacent vertices if and only if u≠v and ⟨v⟩ ⊆ ⟨u⟩ or ⟨u⟩ ⊆ ⟨v⟩.
Volkan Aşkin
doaj   +1 more source

Hosoya polynomial of zigzag polyhex nanotorus [PDF]

open access: yesJournal of the Serbian Chemical Society, 2008
The Hosoya polynomial of a molecular graph G is defined as ... , where d(u,v) is the distance between vertices u and v. The first derivative of H(G,l) at l = 1 is equal to the Wiener index of G, defined as .... . The second derivative of .... at l = 1 is
MEHDI ELIASI, BIJAN TAERI
doaj   +3 more sources

HYPER-WIENER INDEX OF ZIGZAG POLYHEX NANOTUBES [PDF]

open access: yesThe ANZIAM Journal, 2008
Abstract The hyper-Wiener index of a connected graph G is defined as $WW(G)=(1/4)\sum _{(u,v)\in V(G)\times V(G)}\big (d(u,v)+d(u,v)^2\big )$ , where V (G) is the set of all vertices of G and d(u,v) is the distance between the vertices u,v∈V (G).
Eliasi, Mehdi, Taeri, Bijn
openaire   +1 more source

The hyper‐Wiener Index of diamond nanowires

open access: yesInternational Journal of Quantum Chemistry, 2023
Abstract Carbon nanowires based on various structures have various applications. In this article, our focus is on diamond nano‐wires, based on the structure of the diamond. Our goal is to characterize these nanowires by providing their hyper‐Wiener index, one of the basic topological graph indices.
openaire   +2 more sources

Application of Some Topological Indices in Nover Topologized Graphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2023
There are many applications of graph theory to a wide variety of subjects which include operation Research, Physics, chemistry, Economics, Genetics, Engineering, computer Science etc.,In a classical graph for each vertex or edge there are two ...
G. Muthumari, R. Narmada Devi
doaj   +1 more source

Computing the Hosoya Polynomial of M-th Level Wheel and Its Subdivision Graph

open access: yesJournal of Chemistry, 2021
The determination of Hosoya polynomial is the latest scheme, and it provides an excellent and superior role in finding the Weiner and hyper-Wiener index. The application of Weiner index ranges from the introduction of the concept of information theoretic
Peng Xu   +5 more
doaj   +1 more source

Distance-Based Polynomials and Topological Indices for Hierarchical Hypercube Networks

open access: yesJournal of Mathematics, 2021
Topological indices are the numbers associated with the graphs of chemical compounds/networks that help us to understand their properties. The aim of this paper is to compute topological indices for the hierarchical hypercube networks. We computed Hosoya
Tingmei Gao, Iftikhar Ahmed
doaj   +1 more source

Topological Indices of Graphs from Vector Spaces

open access: yesMathematics, 2023
Topological indices are numbers that are applied to a graph and can be used to describe specific graph properties through algebraic structures. Algebraic graph theory is a helpful tool in a range of chemistry domains.
Krishnamoorthy Mageshwaran   +3 more
doaj   +1 more source

Hosoya Polynomials Of Some Semiconducotors

open access: yesJournal of Kufa for Mathematics and Computer, 2014
The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x = 1 is equal to the Wiener index and second derivative at x =1 is equal to the hyperWiener index.
Azeez Lafta Jabir   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy