Results 51 to 60 of about 4,659 (167)
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On graphs with the same restricted U -polynomial and the U -polynomial for rooted graphs [PDF]
Electronic Notes in Discrete Mathematics, 2018 In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.
Aliste Prieto, José +2 more
openaire +3 more sources
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Algorithms, 2019 The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article.
Hristo N. Djidjev +4 more
doaj +1 more source
Coloring Rings in Species [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species.
Jacob White
doaj +1 more source
Homomorphisms and polynomial invariants of graphs
European Journal of Combinatorics, 2007 Junta de Andalucía P06-FQM ...
Delia Garijo +2 more
openaire +5 more sources
Chromatic Polynomials and Cryptographic Hashing on WIP-Quasigroup Structures
Journal of MathematicsCryptographic hash functions are indispensable for today’s information security because they secure data integrity, authentication and encrypted storage.
Mohammad Mazyad Hazzazi +4 more
doaj +1 more source
Zagreb Polynomials of Certain Families of Dendrimer Nanostars
Tikrit Journal of Pure Science, 2023 Let G be a simple connected graph with vertex set V(G) and edge set E(G). The first, second and third Zagreb polynomials of G are defined as , and A dendrimer is an artificially manufactured or synthesized molecule built up from branched units ...
Nabeel E. Arif
doaj +1 more source
Graph-Counting Polynomials for Oriented Graphs [PDF]
Journal of Statistical Physics, 2018 6 ...
openaire +2 more sources
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
AxiomsGraph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 1987 Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown.
E. J. Farrell
doaj +1 more source