شماره ركورد كنفرانس :
5263
عنوان مقاله :
OPTIMAL INFORMATION RATIO OF SOME GRAPH ACCESS STRUCTURES
پديدآورندگان :
Ahmadi Bahman bahman.ahmadi@shirazu.ac.ir Department of Mathematics, Shiraz University, Shiraz, Iran. , Talebpour Shirazi Fard Seyed Alireza seyed.alireza.talebpour@gmail.com Department of Mathematics, Shiraz University, Shiraz, Iran.
كليدواژه :
secret sharing scheme , graph , information ratio
عنوان كنفرانس :
54 امين كنفرانس رياضي ايران
چكيده فارسي :
The problem of determining the information ratio of a graph access structure, σ(G), has turned out to be a challenging one in the recent years. A conjecture due to Csirmaz and Ligeti states that if 1 σ(G) 2, then σ(G) = 2 − 1/n , for some integer n. In this paper, for some families of graphs G, we provide evidences for the truth of this conjecture
