Titlebook: Algorithms and Discrete Applied Mathematics; Third International Daya Gaur,N.S. Narayanaswamy Conference proceedings 2017 Springer Interna

只看該作者 · 發(fā)表于 2025-3-26 22:22:40

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two, for a .-decomposition of a semi-complete directed graph. In particular, we show that a tournament admits a .-decomposition iff its outdegree sequence is the degree sequence of a simple undirected graph.

只看該作者 · 發(fā)表于 2025-3-27 02:13:13

On Rank and MDR Cyclic Codes of Length , Over , ,respect to rank) cyclic codes of length . over . is given. An example of the best codes over . of length 4 having largest minimum Hamming, Lee and Euclidean distances among all codes of the same rank is also given.

只看該作者 · 發(fā)表于 2025-3-27 09:16:17

只看該作者 · 發(fā)表于 2025-3-27 10:50:56

只看該作者 · 發(fā)表于 2025-3-27 13:41:39

只看該作者 · 發(fā)表于 2025-3-27 20:09:10

只看該作者 · 發(fā)表于 2025-3-28 01:03:17

https://doi.org/10.1007/978-3-319-53007-9Computer Science; clustering; colored mixed graphs; comparability; embedding; graph algorithm; minimal deg

只看該作者 · 發(fā)表于 2025-3-28 04:04:54

只看該作者 · 發(fā)表于 2025-3-28 09:17:08

Daya Gaur,N.S. NarayanaswamyIncludes supplementary material:

只看該作者 · 發(fā)表于 2025-3-28 14:12:11

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153169.jpg

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 11:05
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved