Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size

DOI10.1016/0012-365X(84)90061-XMaRDI QIDQ1065035zbMATH OpenFDO

Authors Curtiss Barefoot

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interpolation theoremsconnected spanning subgraph

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 1135673
• Counting of spanning trees in complete graph \(K_p\) of even order
• Interpolation theorem for the number of generalized end-vertices of spanning trees
• scientific article; zbMATH DE number 4114652
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs

Cites work

• Interpolation theorem for the number of end‐vertices of spanning trees

Cited in

(7)

• Interpolation theorems for the arboricity and the vertex arboricity of graphs
• Interpolation theorem for a continuous function on orientations of a simple graph
• Interpolation theorems for a family of spanning subgraphs
• Matroid tree graphs and interpolation theorems
• Interpolation theorem for the number of generalized end-vertices of spanning trees
• On numbers of vertices of maximum degree in the spanning trees of a graph
• Interpolation theorems for domination numbers of a graph

This page was built for publication: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size

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