Some New Bounds on the Information Ratio of the Cartesian Product of Some Classes of Graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

CHERAGHI A.; GHOLAMI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2019 | Volume:6 | Issue:4 (24) Page(s): 135-142

Download Full-Text

Persian Verion

View:

382

Download:

Cites:

Information Journal Paper

Title

Some New Bounds on the Information Ratio of the Cartesian Product of Some Classes of Graphs

Author(s)

CHERAGHI A. | GHOLAMI M. | Issue Writer Certificate

Keywords

Secret Sharing SchemeQ1

Information RatioQ1

Cartesian ProductQ1

Abstract

In this paper, we find a lower-bound for the Information Ratio of the Cartesian Product of an arbitrary tree with diameter at least 3 and a cycle Cm for every m 3. Moreover, we determine the best Information Ratio of the perfect Secret Sharing Scheme based on the graph constructed from the Cartesian Product of a cycle of length 6 with the d-dimensional cube Qd. More precisely, it is shown that for every d 1, the Information Ratio of is exactly.

Cites

No record.

References

No record.

Cite

APA: Copy

CHERAGHI, A., & GHOLAMI, M.. (2019). Some New Bounds on the Information Ratio of the Cartesian Product of Some Classes of Graphs. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 6(4 (24) ), 135-142. SID. https://sid.ir/paper/243143/en

Vancouver: Copy

CHERAGHI A., GHOLAMI M.. Some New Bounds on the Information Ratio of the Cartesian Product of Some Classes of Graphs. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2019;6(4 (24) ):135-142. Available from: https://sid.ir/paper/243143/en

IEEE: Copy

A. CHERAGHI, and M. GHOLAMI, “Some New Bounds on the Information Ratio of the Cartesian Product of Some Classes of Graphs,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 6, no. 4 (24) , pp. 135–142, 2019, [Online]. Available: https://sid.ir/paper/243143/en

Related Journal Papers