An efficient algorithm for computing permanental polynomials of graphs.Computer Physics Com- munications, 175(3):196–203

Yan Huo, Heng Liang, Fengshan Bai · 2006

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2026-04-27 · unverdicted · novelty 6.0

Permanental energy of any m-edge graph is at least 2√m, with equality if and only if the graph is a star plus isolated vertices.

Showing 1 of 1 citing paper.

Permanental Energy of Graphs math.CO · 2026-04-27 · unverdicted · none · ref 11
Permanental energy of any m-edge graph is at least 2√m, with equality if and only if the graph is a star plus isolated vertices.