Results 71 to 80 of about 268,469 (172)
In this paper, we present the structure of the maximal ideal graph of the ring . Several graph properties are given including completeness, planarity, separability. Furthermore, we show that is Hamiltonian, and Eulerian under certain conditions.
Nigar M Azeez, Fryad H. Abdulqadr
doaj +1 more source
Hosoya Polynomials of Mycielskian Graphs
Vulnerability measures and topological indices are crucial in solving various problems such as the stability of the communication networks and development of mathematical models for chemical compounds. In 1947, Harry Wiener introduced a topological index related to molecular branching.
Vaidya, Sanju, Li, Aihua
openaire +2 more sources
On acyclic systems with minimal Hosoya index [PDF]
The Hosoya index of a graph is defined as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya ...
Hou, Yaoping
core +1 more source
Hosoya Index of L-Type Polyphenyl Spiders [PDF]
The polyphenyl system is composed of n hexagons obtained from two adjacent hexagons that are sticked by a path with two vertices. The Hosoya index of a graph G is defined as the total number of the independent edge sets of G.
Wu Tingzeng, Ren Shengzhang
core +1 more source
ON VULNERABILITY MEASURES OF NETWORKS
As links and nodes of interconnection networks are exposed to failures, one of the most important features of a practical networks design is fault tolerance.
Rija Erveš +2 more
doaj
Penentuan Solusi Hosoya Triangle [PDF]
Hosoya Triangle didefinisikan secara rekursif sebagai penjumlahan dari dua bilangan di atasnya. Skripsi ini mengkaji tentang pendefinisian Hosoya Triangle yang melibatkan bilangan Fibonacci dan penentuan solusi Hosoya Triangle dengan menggunakan fungsi ...
KAOSAR, Gani Rokhmatulloh
core
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
Hosoya Polynomial of Graphs Belonging to Twist Knots
There is a deep relationship between knot theory and graph theory. Graphs are effective tools forstudies into knot theory. It is possible to switch between the two theories by forming the graphs of knots.
Şahin, Abdulgani, Şahin, Bünyamin
core +1 more source
Coulson function and Hosoya index
Let G be a molecular graph, n the number of its vertices and φ(G,x) its characteristic polynomial. Already in 1940 Coulson expressed the total π-electron energy of conjugated unsaturated molecules in terms of the function F(x)=n−ixφ′(G,ix)/φ(G,ix ...
Vidović, Dušica +2 more
core +1 more source
A two-variable approach to solve the polynomial Lyapunov equation
A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf, Rapisarda, Paolo
core +2 more sources

