Results 91 to 100 of about 1,818 (187)
Results in Control and OptimizationModels of nonlinear partial differential equations are essential in the theoretical sciences, especially Physics and Mathematics. It is exceedingly challenging to arrive at an analytical solution.
AN Nirmala, S. Kumbinarasaiah
doaj +1 more source
The Geometry of some Fibonacci Identities in the Hosoya Triangle
, 2018 In this paper we explore some Fibonacci identities that are interpreted geometrically in the Hosoya triangle. Specifically we explore a generalization of the Cassini and Catalan identities from a geometric point of view.
Flórez, Rigoberto +2 more
core
Extended Idempotent Divisor Graph of Zn [PDF]
Al-Rafidain Journal of Computer Sciences and MathematicsAssociate graph Л(R) is said to be idempotent divisor graph with vertices set in R*=R-{0} and two non- zero distinct vertices a and b are adjacent if and only if a.b=e, where e an idempotent element non equal 1.
Husam mohammad, Sumaya Mohammed
doaj +1 more source
The Hosoya polynomial decomposition for catacondensed benzenoid graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Shoujun, Zhang, Heping
openaire +2 more sources
Extremal Matching Energy of Complements of Trees
Discussiones Mathematicae Graph Theory, 2016 Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph.
Wu Tingzeng, Yan Weigen, Zhang Heping
doaj +1 more source
ON THE SCHULTZ POLYNOMIAL AND HOSOYA POLYNOMIAL OF CIRCUMCORONENE SERIES OF BENZENOID [PDF]
Journal of applied mathematics & informatics, 2013 Let G = (V;E) be a simple connected graph. The sets of ver- tices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges rep- resent bonds. The distance between the vertices u and v in V (G) of graph G is the number of edges in a shortest path connecting them, we denote ...
openaire +1 more source
Computing Hosoya polynomials of graphs from primary subgraphs
, 2012 The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomials of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs.
Deutsch, Emeric, Klavzar, Sandi
openaire +2 more sources
A novel perspective for M-polynomials to compute molecular descriptors of borophene nanosheet. [PDF]
Sci Rep, 2023 Ismail R +6 more
europepmc +1 more source
Evidences of Interdependence and Contagion using a Frequency Domain Framework [PDF]
The purpose of this paper is to propose a new measure of contagion. Our approach to testing contagion is based on the frequency analysis of causality developed recently by Breitung and Candelon (2004).
Bodart,Vincent, Candelon,Bertrand
core +1 more source
ON VULNERABILITY MEASURES OF NETWORKS
Croatian Operational Research Review, 2013 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