scientific article; zbMATH DE number 6256206

zbMath1289.05268MaRDI QIDQ5396536

Francesco Belardo, Vincenco de Filippis, Slobodan K. Simic

Publication date: 7 February 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matrix polynomialsweighted digraphscombinatorial computation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients ⋮ Per-spectral characterizations of some bipartite graphs ⋮ On the characterizing properties of the permanental polynomials of graphs ⋮ A note on the permanental roots of bipartite graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ Some extremal graphs with respect to permanental sum ⋮ On the permanental nullity and matching number of graphs ⋮ On the permanental sum of graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges

This page was built for publication: