Login / Signup
Bounds for complete cototal domination number of Cartesian product graphs and complement graphs.
J. Maria Regila Baby
K. Uma Samundesvari
Published in:
Discret. Math. Algorithms Appl. (2022)
Keyphrases
</>
cartesian product
series parallel
connected graphs
random graphs
graph matching
computational complexity
graph clustering
maximum number
graph databases
small number
undirected graph
complex structures
graph mining
graph representation
weighted graph
upper bound
association rules
polynomial time complexity
data sets