Author of the publication

On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs.

, and . Discret. Appl. Math., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the algorithmic complexity of decomposing graphs into regular/irregular structures., , , and . CoRR, (2018)A practical fault induction attack against an FPGA implementation of AES cryptosystem., , and . WorldCIS, page 134-138. IEEE, (2013)On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix., and . IEEE Trans. Inf. Theory, 66 (10): 6037-6047 (2020)From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation., and . ITW, page 1-5. IEEE, (2019)On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs., and . Discret. Appl. Math., (2017)On the semi-proper orientations of graphs.. CoRR, (2019)On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth., and . ITW, page 1-5. IEEE, (2019)From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes., and . IEEE Trans. Inf. Theory, 65 (4): 2062-2074 (2019)On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles., and . IEEE Trans. Inf. Theory, 64 (6): 4438-4451 (2018)Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles., and . IEEE Trans. Inf. Theory, 65 (10): 6022-6043 (2019)