• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Advisory Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Transactions on Combinatorics
Articles in Press
Current Issue
Journal Archive
Volume Volume 8 (2019)
Volume Volume 7 (2018)
Volume Volume 6 (2017)
Volume Volume 5 (2016)
Volume Volume 4 (2015)
Volume Volume 3 (2014)
Volume Volume 2 (2013)
Volume Volume 1 (2012)
Davarzani, M. (2019). VISUAL CRYPTOGRAPHY SCHEME ON GRAPHS. Transactions on Combinatorics, (), -. doi: 10.22108/toc.2019.113671.1599
Mahmood Davarzani. "VISUAL CRYPTOGRAPHY SCHEME ON GRAPHS". Transactions on Combinatorics, , , 2019, -. doi: 10.22108/toc.2019.113671.1599
Davarzani, M. (2019). 'VISUAL CRYPTOGRAPHY SCHEME ON GRAPHS', Transactions on Combinatorics, (), pp. -. doi: 10.22108/toc.2019.113671.1599
Davarzani, M. VISUAL CRYPTOGRAPHY SCHEME ON GRAPHS. Transactions on Combinatorics, 2019; (): -. doi: 10.22108/toc.2019.113671.1599

VISUAL CRYPTOGRAPHY SCHEME ON GRAPHS

Articles in Press, Accepted Manuscript , Available Online from 04 February 2019  XML
Document Type: Research Paper
DOI: 10.22108/toc.2019.113671.1599
Author
Mahmood Davarzani
Faculty of Mathematics and Computer Science, Kharazmi University, Tehran, Iran.
Abstract
‎Let $G=(V,E)$ be a connected graph and $Gamma (G)$ be the strong access structure where obtained from graph $G$‎. ‎A visual cryptography scheme (VCS) for a set $P$ of participants is a method to encode a secret image such that any pixel of this image change to $m$ subpixels and only qualified sets can recover the secret image by stacking their shares‎. ‎The value of $m$ is called the pixel expansion and the minimum value of the pixel expansion of a VCS for $Gamma (G)$ is denoted by $m^{*}(G)$‎. ‎In this paper we obtain a characterization of all connected graphs $G$ with $m^{*}(G)=4$ and $omega (G)=‎5‎$ which $omega(G)$ is the clique number of graph $G$‎.
Keywords
Visual cryptography scheme; Access structure; Pixel expansion
Main Subjects
94C15 Applications of graph theory
Statistics
Article View: 8
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Journal Management System. Designed by sinaweb.