Algorithmic releases on the spanning trees of suitable graphs

Authors Maurizio Imbesi, Monica La Barbiera, Santo Saraceno

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Abstract: In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for a Jahangir graph.

This page was built for publication: Algorithmic releases on the spanning trees of suitable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6503281)