Results 121 to 130 of about 7,067 (209)
On topological co-index polynomials for predictive modeling of the physicochemical properties of antiviral drugs. [PDF]
Sci RepMeharban S +6 more
europepmc +1 more source
Graph-Theoretical Approach for Predicting Physicochemical Properties of Stiff-Person Syndrome Drugs. [PDF]
ChemistryOpenAli J, Ali Y, Malik MA, Shang Y.
europepmc +1 more source
Graph polynomials: some questions on the edge
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory.
Morgan, Kerri, Farr, Graham
core
Reconstructing Subgraph-Counting Graph Polynomials of Increasing Families of Graphs
, 2008 A graph polynomial P (G, x) is called reconstructible if it is uniquely determined by the polynomials of the vertex deleted subgraphs of G for every graph G with at least three vertices. In this note it is shown that subgraph-counting graph polynomials
Bostjan Bresar, Wilfried Imrich
core
Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms. [PDF]
Philos Trans A Math Phys Eng SciMinenkova A, Mograby G, Zhan H.
europepmc +1 more source
Meta-theorems for Graph Polynomials
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of graph ...
Makowsky, Johann A.
core
Quadratic Subproduct Systems, Free Products, and Their C*-Algebras. [PDF]
Integr Equ Oper TheoryArici F, Ge Y.
europepmc +1 more source
Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]
Front Comput NeurosciWang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc +1 more source
Fully Characterizing Lossy Catalytic Computation. [PDF]
AlgorithmicaFolkertsma M +3 more
europepmc +1 more source