Role of Degree Sequence in Determination of Maximal Clique of a Graph

Journal of Global Research in Computer Sciences

article

Krishnendu Basuli¹  Saptarshi Naskar²  Samar Sen Sarma³ 

[1] Dept. of Computer Science, West Bengal State University;Dept. of Computer Science, Sarsuna College;Department of Computer Science and Engineering, University of Calcutta

关键词: Graphic sequence;    Clique Number;    Isomorphism;    drop-m;    p-laying off;   

来源: Research & Reviews

【 摘 要 】

The paper high lights the relation between Discrete Mathematics and Computer Science and Engineering. Since, Graphs and Graph-Algorithms are core topic in combinatorial Algorithms[6]. Our attempt is religious. This is a practice even adopted by D.E. Knuth[6] and shows that we are in a era where visual representation of graphs is a tertiary affair.

【 授权许可】

Unknown