TY - JOUR

T1 - Encryption System Involving Matrix Associated With Semigraphs

AU - Shetty, Jyoti

AU - Sudhakara, G.

AU - Madhusudanan, Vinay

N1 - Publisher Copyright:
© 2022. IAENG International Journal of Applied Mathematics.All Rights Reserved

PY - 2022

Y1 - 2022

N2 - Semigraphs are a generalization of graphs, where an edge is allowed to have two or more vertices. A binomial incidence matrix is an incidence matrix of a semigraph which represents the semigraph uniquely. We prove that, the binomial incidence matrix of any semigraph belonging to one of two specific classes of semigraphs, is invertible. Then we note a peculiar property enjoyed by the columns of a submatrix of the adjoint of the binomial incidence matrix of semigraphs under consideration. By making use of this property, we develop an encryption system which uses invertibility of the binomial incidence matrix.

AB - Semigraphs are a generalization of graphs, where an edge is allowed to have two or more vertices. A binomial incidence matrix is an incidence matrix of a semigraph which represents the semigraph uniquely. We prove that, the binomial incidence matrix of any semigraph belonging to one of two specific classes of semigraphs, is invertible. Then we note a peculiar property enjoyed by the columns of a submatrix of the adjoint of the binomial incidence matrix of semigraphs under consideration. By making use of this property, we develop an encryption system which uses invertibility of the binomial incidence matrix.

UR - http://www.scopus.com/inward/record.url?scp=85131049671&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85131049671&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85131049671

SN - 1992-9978

VL - 52

JO - IAENG International Journal of Applied Mathematics

JF - IAENG International Journal of Applied Mathematics

IS - 2

M1 - IJAM_52_2_24

ER -