On enumerating paths of K arcs in unoriented complete graphs

DOI10.1016/0016-0032(75)90086-1zbMath0311.05123OpenAlexW1981285643MaRDI QIDQ1219305

Eugene Radwin, Samuel D. Bedrosian

Publication date: 1975

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(75)90086-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Generating formulas for the number of trees in a graph
• Graphs, dynamic programming, and finite games
• Principles of combinatorics
• Synthesis of Switching Functions by Linear Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On enumerating paths of K arcs in unoriented complete graphs