Graph Learning (GL) is at the core of leveraging connections in machine learning (ML). By observing a dataset graph signals and considering specific assumptions, Signal Processing (GSP) provides practical constraints GL. Inferring with desired frequency signatures, i.e., spectral templates, from stationary has gained great attention. However, severe computational burden challenging barrier, esp...

The orientable domination number, DOM(G), of a graph G is the largest number over all orientations G. In this paper, DOM studied on different product graphs and related operations. arbitrary corona products determined, while sharp lower upper bounds are proved for Cartesian lexicographic products. A result Chartrand et al. (1996) extended by establishing values DOM(Kn1,n2,n3) positive integers ...

in this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. we present some sufficient and necessary conditions for $gbox h$ being hamilton-connected when $g$ is a hamilton-connected graph and $h$ is a tree or $g$ is a hamiltonian graph and $h$ is $k_2$.