首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On a Max-min Problem Concerning Weights of Edges
Authors:Stanislav Jendrol'  Ingo Schiermeyer
Institution:Department of Geometry and Algebra, P. J. ?afárik University; 04154 Ko?ice, Slovak Republic; E-mail: jendrol@kosice.upjs.sk, SK
Fakult?t für Mathematik und Informatik, Technische Universit?t Bergakademie Freiberg; D-09596 Freiberg, Germany; E-mail: schierme@math.tu-freiberg.de, DE
Abstract:The weight w(e) of an edge e = uv of a graph is defined to be the sum of degrees of the vertices u and v. In 1990 P. Erdős asked the question: What is the minimum weight of an edge of a graph G having n vertices and m edges? This paper brings a precise answer to the above question of Erdős. Received July 12, 1999
Keywords:AMS Subject Classification (2000) Classes:   05C35
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号