An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs
Publications de l'Institut Mathématique (1986)
- Volume: 39(53), Issue: 59, page 63-67
- ISSN: 0350-1302
Access Full Article
top
How to cite
topE.J. Farrell, and J.C. Grell. "An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs." Publications de l'Institut Mathématique 39(53).59 (1986): 63-67. <http://eudml.org/doc/257743>.
@article{E1986,
author = {E.J. Farrell, J.C. Grell},
journal = {Publications de l'Institut Mathématique},
keywords = {graph polynomial; circuit polynomial; number of spanning trees},
language = {eng},
number = {59},
pages = {63-67},
publisher = {Matematički institut SANU},
title = {An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs},
url = {http://eudml.org/doc/257743},
volume = {39(53)},
year = {1986},
}
TY - JOUR
AU - E.J. Farrell
AU - J.C. Grell
TI - An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs
JO - Publications de l'Institut Mathématique
PY - 1986
PB - Matematički institut SANU
VL - 39(53)
IS - 59
SP - 63
EP - 67
LA - eng
KW - graph polynomial; circuit polynomial; number of spanning trees
UR - http://eudml.org/doc/257743
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.