Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem

zbMath1307.05185MaRDI QIDQ482492

Paul August Winter, Fadekemi Janet Adewusi

Publication date: 30 December 2014

Published in: Advances in Mathematics. Scientific Journal (Search for Journal in Brave)

zbMATH Keywords

vertex coversecretary problemsocial interactionratioareasconstant \(1/e\) as convergent solution of differential equationsconvergence asymptotesnetwork communicationspanning trees of graphics

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects

This page was built for publication: Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem