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

[摘要] 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.

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