سال انتشار: ۱۳۸۶

محل انتشار: سی و هشتمین کنفرانس ریاضی ایران

تعداد صفحات: ۱

نویسنده(ها):

BEHZAD SALEHIAN – Department of Mathematics, Tehran University, Tehran, Iran
FATEMEZAHRA GHANBARI – Shariati School, Bandpai Gharbi, Babol, Iran

چکیده:

The toughness of a graph is the graphs vulnerability to having vertices removed. For example, if vertices of a graph represent homes, and the edge of the graph represent telephone lines connecting them, then the toughness measures how badly telephone communication can broken down by relatively few lightening strikes. In this paper the maximum networks are obtained with prescribed order and toughness.