抽象的

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

Krishnendu Basuli, Saptarshi Naskar, Samar Sen Sarma

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.

索引于

谷歌学术
学术期刊数据库
打开 J 门
学术钥匙
研究圣经
引用因子
电子期刊图书馆
参考搜索
哈姆达大学
学者指导
国际创新期刊影响因子(IIJIF)
国际组织研究所 (I2OR)
宇宙

查看更多