شماره ركورد كنفرانس :
4330
عنوان مقاله :
Lexicographic Product of Vague Graphs
عنوان به زبان ديگر :
Lexicographic Product of Vague Graphs
پديدآورندگان :
Borzooei .R. A borzooei@sbu.ac.ir Shahid Beheshti University , Sheikh Hoseini .B b_sheikhhoseini@sbu.ac.ir Shahid Beheshti University , Mohseni Takaloo .M mohammad.mohseni1122@gmail.com Shahid Beheshti University
كليدواژه :
Vague graph , lexicographic min , product , lexicographic max , product
عنوان كنفرانس :
هفدهمين كنفررانس ملي سيستم هاي فازي، پانزدهمين كنفرانس ملي سيستم هاي هوشمند و ششمين كنگره ملي مشترك سيستم هاي فازي و هوشمند ايران
چكيده فارسي :
A vague graph is a generalized structure of a fuzzy graph that gives more precision,
flexibility and compatibility to a system when compared with systems that are designed using
fuzzy graphs. In this paper, we introduce the notion of lexicographic (min) max-product of
two vague graphs. The degree of a vertex in the lexicographic products of two vague graphs is
obtained. Finally, the relationship between the lexicographic min-product and lexicographic
max-product is studied.
چكيده لاتين :
A vague graph is a generalized structure of a fuzzy graph that gives more precision,
flexibility and compatibility to a system when compared with systems that are designed using
fuzzy graphs. In this paper, we introduce the notion of lexicographic (min) max-product of
two vague graphs. The degree of a vertex in the lexicographic products of two vague graphs is
obtained. Finally, the relationship between the lexicographic min-product and lexicographic
max-product is studied.
