6 citations · 19 across the 17 of their papers we have counts for
3 papers · 1 filter
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers as reducible permutation flow-graphs…
Linear Coloring and Linear Graphs
Kyriaki Ioannidou, Stavros D. Nikolopoulos
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it wa…
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs
Stavros D. Nikolopoulos, Charis Papadopoulos
In this paper we examine the classes of graphs whose -complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $…