Results 81 to 90 of about 1,818 (187)
The higher-order matching polynomial of a graph
International Journal of Mathematics and Mathematical Sciences, 2005 Given a graph G with n vertices, let p(G,j) denote the number of ways j mutually nonincident edges can be selected in G. The polynomial M(x)=∑j=0[n/2](−1)jp(G,j)xn−2j, called the matching polynomial of G, is closely related to the Hosoya index introduced
Oswaldo Araujo +3 more
doaj +1 more source
Carmichael Numbers on a Quantum Computer [PDF]
, 1999 We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type.
Carlini, A., Hosoya, A.
core +1 more source
Enhanced Chemical Insights into Fullerene Structures via Modified Polynomials
Complexity, Volume 2024, Issue 1, 2024.This work explores the complicated realm of fullerene structures by utilizing an innovative algebraic lens to unravel their chemical intricacies. We reveal a more profound comprehension of the structural subtleties of fullerenes by the computation of modified polynomials that are customized to their distinct geometric and electrical characteristics. In
Ali N. A. Koam +5 more
wiley +1 more source
The n-Hosoya Polynomials of Some Classes of Thorn Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 The n-Hosoya Polynomials of cog-complete graphs , thorn cog-complete graphs , cog-stars , thorn cog-stars , cog-wheels , and thorn cog-wheels are obtained . The n-Wiener indices of these graphs are also determined .
Ali Ali, Ahmed Ali
doaj +1 more source
On Terminal Hosoya Polynomial of Some Thorn Graphs
, 2018 In this paper we obtain the terminal Hosoya polynomial for caterpillers, thorn stars and thorn rings. These results generalizes the existing results.
Harishchandra S.Ramane +2 more
openaire +1 more source
Exploring the Distance‐Based Topological Indices for Total Graphs via Numerical Comparison
Journal of Mathematics, Volume 2024, Issue 1, 2024.Graph theory serves as a valuable tool across numerous scientific disciplines, offering the means to model and analyze intricate networks. In this study, we explore the application of distance‐based topological indices to a variety of graphs, including the total graph of paths, cycles, complete graphs, wheel graphs, helm graphs, and the Cartesian ...
Haseeb Ahmad +4 more
wiley +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
The Hosoya polynomial of distance-regular graphs
Discrete Applied Mathematics, 2014 In this note we obtain an explicit formula for the Hosoya polynomial of any distance-regular graph in terms of its intersection array. As a consequence, we obtain a very simple formula for the Hosoya polynomial of any strongly regular graph.
Rodríguez-Velázquez, J.A., Deutsch, E.
openaire +3 more sources
Distance matrices of a tree: two more invariants, and in a unified framework
, 2019 Graham-Pollak showed that for $D = D_T$ the distance matrix of a tree $T$, det$(D)$ depends only on its number of edges. Several other variants of $D$, including directed/multiplicative/$q$- versions were studied, and always, det$(D)$ depends only on the
Choudhury, Projesh Nath, Khare, Apoorva
core
Hosoya polynomials of general spiro hexagonal chains
Filomat, 2014 Spiro hexagonal chains are a subclass of spiro compounds which are an important subclass of Cycloalkynes in Organic Chemistry. This paper addresses general spiro hexagonal chains in which every hexagon represents a benzene ring, and establishes the formulae for computing the Hosoya polynomials of general spiro hexagonal chains.
Xianyong Li +3 more
openaire +1 more source