Complexity of trapezoidal graphs with different triangulations

MaRDI QIDQ2869144zbMATH OpenFDO

Authors S. N. Daoud, A. Elsonbaty

Publication date 3 January 2014

Published in Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

spanning trees in graphstrapezoidal graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Chebyshev polynomials and spanning tree formulas
• Complexity of products of some complete and complete bipartite graphs
• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• scientific article; zbMATH DE number 55681
• Number of spanning trees of different products of complete and complete bipartite graphs

Cited in

(2)

• On the structure of trapezoid graphs
• Trapezoid graphs and generalizations, geometry and algorithms

This page was built for publication: Complexity of trapezoidal graphs with different triangulations

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