Finding Contents or People

M. Mohamadi
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
On the lower bound of the sum of the algebraic connectivity of a graph and its complement
Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization
Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph
Including the Size of Regions in Image Segmentation by Region-Based Graph
On the characteristic polynomial of special class of graphs and spectra of balanced trees
The characterization of graphs with the largest Laplacian eigenvalue at most (5 sqrt(13))/2
The spectral characterization of graphs of index less than 2 with no Zn as a component
Graphs with three distinct eigenvalues and largest eigenvalue less than 8
The spectral characterization of graphs of index less than 2 with no path as a component
Rings Whose Annihilating-Ideal Graphs Have Positive Genus
Nordhaus-Gaddum Inequalities for Sigma Clique Partition Number of Graphs
Nordhaus-Gaddum Inequalities for sigma clique partition number of graphs
Some graphs associated to certain algebraic structures such as rings and modules