抽象的

ON AUTOMORPHISM OF LABELED SIMPLE CONNECTED GRAPH FROM PRESCRIBED DEGREES

Bidipta Majumder, Subhajit Guha and Soumyasri Ghosh

On counting of labeled connected graphs, the question comes into mind first; “How many ways a graph can be labeled?” As there exist certain number of labeled isomorphic graphs. On finding non isomorphic labeled graphs is an interesting problem itself. To provide the fact, graph automorphism should be considered.

免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

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

查看更多