Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Comprehensive Overview on the Formation of Homomorphic Copies in Coset Graphs for the Modular Group
View through CrossRef
This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications. The group action of G on real quadratic fields forms infinite coset graphs. These graphs are made up of closed paths. When M acts on the finite field Zp, the coset graph appears through the contraction of the vertices of these infinite graphs. Thus, finite coset graphs are composed of homomorphic copies of closed paths in infinite coset graphs. In this work, we have presented a comprehensive overview of the formation of homomorphic copies.
Title: A Comprehensive Overview on the Formation of Homomorphic Copies in Coset Graphs for the Modular Group
Description:
This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications.
The group action of G on real quadratic fields forms infinite coset graphs.
These graphs are made up of closed paths.
When M acts on the finite field Zp, the coset graph appears through the contraction of the vertices of these infinite graphs.
Thus, finite coset graphs are composed of homomorphic copies of closed paths in infinite coset graphs.
In this work, we have presented a comprehensive overview of the formation of homomorphic copies.
Related Results
Development Paillier's library of fully homomorphic encryption
Development Paillier's library of fully homomorphic encryption
One of the new areas of cryptography considered-homomorphic cryptography. The article presents the main areas of application of homomorphic encryption. An analysis of existing deve...
Młodociani sprawcy przestępstw przeciwko mieniu
Młodociani sprawcy przestępstw przeciwko mieniu
The new Polish penal legislation of 1969 introduced special rules of criminal liability of young adult offenders' aged 17-20. In 1972 criminological research was undertaken in orde...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Homomorphic Encryption and its Application to Blockchain
Homomorphic Encryption and its Application to Blockchain
The concept, method, algorithm and application of the advanced field of cryptography, homomorphic encryption, as well as its application to the field of blockchain are discussed in...
Power of Homomorphic Encryption in Secure Data Processing
Power of Homomorphic Encryption in Secure Data Processing
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. This paper presents a detailed discuss...