Coenzyme
发表于 2025-3-21 18:23:16
书目名称Combinatorial Mathematics IV影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0229928<br><br> <br><br>书目名称Combinatorial Mathematics IV读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0229928<br><br> <br><br>
农学
发表于 2025-3-21 23:50:20
Epidemiology of Sleep Disorders in Womener of each of the pairs contains three disjoint subgraphs isomorphic to G..The same procedure can be used to construct pairs of non-isomorphic and non-cospectral graphs with the same spectral radius containing any two given graphs as disjoint induced subgraphs.
refine
发表于 2025-3-22 02:06:42
http://reply.papertrans.cn/23/2300/229928/229928_3.png
臭了生气
发表于 2025-3-22 08:11:00
Some new constructions for orthogonal designs,es, (e,f,g,32-e-f-g), 0≤e+f+g≤32 are the types of orthogonal designs in order 32..These results are used in a paper by Peter J. Robinson, "Orthogonal designs of order sixteen", in this same volume, to fully update the status of the existence of orthogonal designs in order 16.
uncertain
发表于 2025-3-22 10:05:40
http://reply.papertrans.cn/23/2300/229928/229928_5.png
矛盾心理
发表于 2025-3-22 16:23:29
A non-imbeddable proper colouring,triangle-free colouring of a complete graph in r colours can be derived from some sum-free partition into r parts. We prove that the answer is "no", by exhibiting a triangle-free colouring of K. into three colours which cannot be imbedded in any colouring derived from a sum-free partition into three parts.
矛盾心理
发表于 2025-3-22 18:40:35
http://reply.papertrans.cn/23/2300/229928/229928_7.png
抚育
发表于 2025-3-22 22:39:01
Some computational results on the spectra of graphs,zed by their polynomials together with the polynomials of their complements. In addition, mention is made of those cospectral graphs which have cospectral linegraphs, and those which are cospectral to their own complements.
灿烂
发表于 2025-3-23 01:34:29
http://reply.papertrans.cn/23/2300/229928/229928_9.png
有特色
发表于 2025-3-23 07:00:51
Combinatorial Mathematics IV978-3-540-37537-1Series ISSN 0075-8434 Series E-ISSN 1617-9692