Results 151 to 160 of about 479 (182)
Some of the next articles are maybe not open access.
Determinantal and permanental representations of convolved Lucas polynomials
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adem Şahin, José L. Ramírez
openaire +2 more sources
An efficient algorithm for computing permanental polynomials of graphs
Computer Physics Communications, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huo, Yan, Liang, Heng, Bai, Fengshan
openaire +1 more source
A Differential-Operator Approach to the Permanental Polynomial
Journal of Chemical Information and Computer Sciences, 2002A recently published computational approach to the permanental polynomial scales very badly (approximately 2(n)) with problem size, relying as it does on examining the entire augmented adjacency matrix for nonzero products. The present study presents an entirely different algorithm that relies on symbolic computation of second partial derivatives. This
openaire +2 more sources
On the (Signless) Laplacian Permanental Polynomials of Graphs
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Highly unique network descriptors based on the roots of the permanental polynomial
Information Sciences, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dehmer, Matthias +5 more
openaire +2 more sources
Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Wei, Qin, Zhongmei, Zhang, Heping
openaire +1 more source
Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuchao, Wei, Wei
openaire +1 more source
Recursive formulae for the Laplacian permanental polynomials of signed graphs
Discrete Mathematics, Algorithms and ApplicationsA signed graph [Formula: see text] is defined on a graph [Formula: see text] (known as the underlying graph of [Formula: see text]), where the edges are assigned [Formula: see text] or − sign by a sign function [Formula: see text]. In this paper, we introduce the Laplacian permanental polynomial of a signed graph.
Aqib Khan +2 more
openaire +1 more source
Simple Local Polynomial Density Estimators
Journal of the American Statistical Association, 2020Matias D Cattaneo, Michael Jansson
exaly