Results 31 to 40 of about 268,469 (172)

Chromatic Schultz and Gutman Polynomials of Jahangir Graphs J2,m and J3,m

open access: yesJournal of Applied Mathematics, 2023
Topological polynomial and indices based on the distance between the vertices of a connected graph are widely used in the chemistry to establish relation between the structure and the properties of molecules.
Ramy Shaheen   +2 more
doaj   +1 more source

A New Graphical Representation of the Old Algebraic Structure

open access: yesJournal of Mathematics, Volume 2023, Issue 1, 2023., 2023
The most recent advancements in algebra and graph theory enable us to ask a straightforward question: what practical use does this graph connected with a mathematical system have in the real world? With the use of algebraic approaches, we may now tackle a wide range of graph theory‐related problems.
Muhammad Nadeem   +4 more
wiley   +1 more source

Numerical solution of Advection–Diffusion Equation using Graph theoretic polynomial collocation method

open access: yesResults in Control and Optimization, 2023
Water is one of the main constituents on earth for a living. The Advection Diffusion Equation (ADE) serves as an essential water standard model in environmental engineering since water pollution seriously threatens all life.
Kumbinarasaiah S., Nirmala A.N.
doaj   +1 more source

The Hosoya polynomial of double weighted graphs

open access: yesArs Mathematica Contemporanea, 2018
Summary: The modified Hosoya polynomial of double weighted graphs, i.e. edge and vertex weighted graphs, is introduced that enables derivation of closed expressions for Hosoya polynomial of some special graphs including unicyclic graphs. Furthermore, the Hosoya polynomial is given as a sum of edge contributions generalizing well known analogous results
Tina Novak   +2 more
openaire   +5 more sources

Hosoya, Schultz, and Gutman Polynomials of Generalized Petersen Graphs Pn,1 and Pn,2

open access: yesJournal of Mathematics, 2023
The graph theory has wide important applications in various other types of sciences. In chemical graph theory, we have many topological polynomials for a graph G through which we can compute many topological indices.
Ramy Shaheen   +2 more
doaj   +1 more source

Cryptography by Using"Hosoya"Polynomials for"Graphs Groups of Integer Modulen and"Dihedral Groups with'Immersion"Property

open access: yesIbn Al-Haitham Journal for Pure and Applied Sciences, 2018
      In this paper we used Hosoya polynomial ofgroupgraphs Z1,...,Z26 after representing each group as  graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in
Awni M. Gaftan   +2 more
doaj   +1 more source

On Hosoya Polynomial and Subsequent Indices of C4C8(R) and C4C8(S) Nanosheets

open access: yes, 2022
Chemical structures are mathematically modeled using chemical graphs. The graph invariants including algebraic polynomials and topological indices are related to the topological structure of molecules.
Sidra Rashid   +3 more
core   +1 more source

Terminal Hosoya Polynomial of Line Graphs

open access: yesJournal of Discrete Mathematics, 2013
The terminal Hosoya polynomial of a graph G is defined as TH(G,λ)=∑k≥1‍dT(G,k)λk, where dT(G,k) is the number of pairs of pendant vertices of G that are at distance k. In this paper we obtain terminal Hosoya polynomial of line graphs.
Ramane, H. S.   +3 more
openaire   +2 more sources

Relationship Between the Hosoya Polynomial and the Edge-Hosoya Polynomial of Trees

open access: yes, 2016
We prove the relationship between the Hosoya polynomial and the edge-Hosoya polynomial of trees. The connection between the edge-hyper-Wiener index and the edge-Hosoya polynomial is established. With these results we also prove formulas for the computation of the edge-Wiener index and the edge-hyper-Wiener index of trees using the Wiener index and the ...
Tratnik, Niko, Pleteršek, Petra Žigert
openaire   +2 more sources

Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2

open access: yesJournal of Function Spaces, 2022
Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy