scientific article; zbMATH DE number 861418

MaRDI QIDQ4871152zbMATH OpenFDO

Authors Kevin Burns, R. C. Entringer

Publication date 18 August 1996

zbMATH Keywords

centercentrixcentroidconjecturesdistancesgraph parameterspath numberPostal Servicetransmission number

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• The postal network: A recursive network for parameterized communication model
• Finding postal carrier walk paths in mixed graphs
• scientific article; zbMATH DE number 1290011
• An algorithm for the Rural Postman problem on a directed graph
• The periodic rural postman problem with irregular services on mixed graphs
• scientific article; zbMATH DE number 6741962
• The rural postman problem on directed, mixed, and windy graphs
• scientific article; zbMATH DE number 609929

Cited in

(6)

• Extremal values for ratios of distances in trees
• A note on extremal trees with degree conditions
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Extreme Wiener indices of trees with given number of vertices of maximum degree
• Extremal trees with respect to the Steiner Wiener index
• Parameterized algorithms for computing MAD trees

This page was built for publication:

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