Melodrama
发表于 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.
过分
发表于 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.
Counteract
发表于 2025-3-27 09:16:17
http://reply.papertrans.cn/16/1532/153169/153169_33.png
Compassionate
发表于 2025-3-27 10:50:56
http://reply.papertrans.cn/16/1532/153169/153169_34.png
SAGE
发表于 2025-3-27 13:41:39
http://reply.papertrans.cn/16/1532/153169/153169_35.png
aesthetic
发表于 2025-3-27 20:09:10
http://reply.papertrans.cn/16/1532/153169/153169_36.png
Mediocre
发表于 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
鞭子
发表于 2025-3-28 04:04:54
http://reply.papertrans.cn/16/1532/153169/153169_38.png
GLIB
发表于 2025-3-28 09:17:08
Daya Gaur,N.S. NarayanaswamyIncludes supplementary material:
音乐戏剧
发表于 2025-3-28 14:12:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153169.jpg