Algorithmic releases on the spanning trees of suitable graphs
From MaRDI portal
Publication:6503281
arXiv1704.04892MaRDI QIDQ6503281FDOQ6503281
Authors: Maurizio Imbesi, Monica La Barbiera, Santo Saraceno 
Abstract: In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for a Jahangir graph.
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
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)
