发布求助
文献互助 智能选刊 最新文献

International Conference on Theoretical Computer Science and Discrete Mathematics最新文献

筛选
英文 中文
New Construction on SD-Prime Cordial Labeling SD-Prime甜酒标签的新构建
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_18
A. Lourdusamy, F. Patrick
{"title":"New Construction on SD-Prime Cordial Labeling","authors":"A. Lourdusamy, F. Patrick","doi":"10.1007/978-3-319-64419-6_18","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_18","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114063687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order 奇阶完全图三角化笛卡尔积的P_3分解
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_54
A. Elakkiya, A. Muthusamy
{"title":"P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order","authors":"A. Elakkiya, A. Muthusamy","doi":"10.1007/978-3-319-64419-6_54","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_54","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114020248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Dissecting Power of Certain Matrix Languages 某些矩阵语言的剖析能力
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_13
J. Julie, J. B. Babujee, V. Masilamani
{"title":"Dissecting Power of Certain Matrix Languages","authors":"J. Julie, J. B. Babujee, V. Masilamani","doi":"10.1007/978-3-319-64419-6_13","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_13","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122281127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Restrained Differential of a Graph 图的约束微分
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_43
P. R. L. Pushpam, D. Yokesh
{"title":"Restrained Differential of a Graph","authors":"P. R. L. Pushpam, D. Yokesh","doi":"10.1007/978-3-319-64419-6_43","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_43","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115824313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Indicated Coloring of Cartesian Product of Graphs 图的笛卡儿积的指示着色
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_8
P. Francis, S. Raj
{"title":"Indicated Coloring of Cartesian Product of Graphs","authors":"P. Francis, S. Raj","doi":"10.1007/978-3-319-64419-6_8","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_8","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network 在线社交网络中图形有效保护的双层安全机制
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_9
D. Vinod, V. Vasudevan
{"title":"A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network","authors":"D. Vinod, V. Vasudevan","doi":"10.1007/978-3-319-64419-6_9","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_9","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116362485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Formal Language Representation and Modelling Structures Underlying RNA Folding Process RNA折叠过程的形式语言表达和建模结构
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_3
A. Mahendran, Lakshmanan Kuppusamy
{"title":"Formal Language Representation and Modelling Structures Underlying RNA Folding Process","authors":"A. Mahendran, Lakshmanan Kuppusamy","doi":"10.1007/978-3-319-64419-6_3","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_3","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
1-Distant Irregularity Strength of Graphs 图的远距不规则强度
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_24
K. M. G. Packiam, T. Manimaran, A. Thuraiswamy
{"title":"1-Distant Irregularity Strength of Graphs","authors":"K. M. G. Packiam, T. Manimaran, A. Thuraiswamy","doi":"10.1007/978-3-319-64419-6_24","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_24","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114077597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Probabilistic Conjunctive Grammar 概率连接语法
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_16
K. Devi, S. Arumugam
{"title":"Probabilistic Conjunctive Grammar","authors":"K. Devi, S. Arumugam","doi":"10.1007/978-3-319-64419-6_16","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_16","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Minimum Layout of Circulant Graphs into Certain Height Balanced Trees 循环图在一定高度平衡树中的最小布局
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_12
Jessie Abraham, M. Arockiaraj
{"title":"Minimum Layout of Circulant Graphs into Certain Height Balanced Trees","authors":"Jessie Abraham, M. Arockiaraj","doi":"10.1007/978-3-319-64419-6_12","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_12","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133981754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信