全文获取类型
收费全文 | 100篇 |
免费 | 17篇 |
国内免费 | 3篇 |
专业分类
化学 | 1篇 |
综合类 | 3篇 |
数学 | 116篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 8篇 |
2016年 | 6篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 3篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 11篇 |
2009年 | 9篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 10篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有120条查询结果,搜索用时 15 毫秒
101.
102.
设给出了(h,ψ)-η限长路径问题是图论中的Menger定理的变形和推广,在实时容错网络设计和分析中有重要意义。对于给定的正整数d,Ad(D)表示网络D中任何距离至少为2的两顶点之间内点不交且长度都不超过d的路的最大条数;Bd(D)表示D的顶点子集B中的最小顶点数使得D-B的直径大于d.已证明确定Ad(D)的问题是NPC问题,而且显然有不等式Ad(D)≤Bd(D)。本文考虑D为超立方体网络、De Bruijn网络和Kautz网络,对d的不同值确定了Ad(D)及Bd(D),而且均有Ad(D)=Bd(D)。 相似文献
103.
Josep Díaz Leslie Ann Goldberg David Richerby Maria Serna 《Random Structures and Algorithms》2016,49(1):137-159
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to become extinct. It is known that the expected absorption time for an advantageous mutation is on an n‐vertex undirected graph, which allows the behaviour of the process on undirected graphs to be analysed using the Markov chain Monte Carlo method. We show that this does not extend to directed graphs by exhibiting an infinite family of directed graphs for which the expected absorption time is exponential in the number of vertices. However, for regular directed graphs, we show that the expected absorption time is and . We exhibit families of graphs matching these bounds and give improved bounds for other families of graphs, based on isoperimetric number. Our results are obtained via stochastic dominations which we demonstrate by establishing a coupling in a related continuous‐time model. The coupling also implies several natural domination results regarding the fixation probability of the original (discrete‐time) process, resolving a conjecture of Shakarian, Roos and Johnson. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 137–159, 2016 相似文献
104.
Lionello Pogliani 《Journal of mathematical chemistry》2009,46(1):15-23
Graphs are used in many fields of chemistry for codification and model purposes. One of these fields is widely known under
the acronym QSAR/QSPR, i.e., quantitative structure–activity/structure–property relationships. In chemical graph studies directed
graphs, known as digraphs, i.e., graphs with a preferred direction, have mainly been used to codify chemical reaction networks.
Actually, digraphs, especially directed acyclic graphs together with simple graphs, can be used to draw a metalanguage of
thermodynamics that codifies rules and properties which can be used to automatically derive many well-known, and less-known,
thermodynamic relationships. 相似文献
105.
106.
Guillaume Ducoffe 《Discrete Applied Mathematics》2013,161(13-14):2200-2204
In this article, we determine when the large generalized de Bruijn cycles are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized cycles. They are Kronecker products of generalized de Bruijn digraphs and dicycles. 相似文献
107.
提出了有向图的SAS-全染色的概念,有向图D的SAS-全染色是D的一个正常全染色,若对D中点染色来说,不存在长为3的2色有向路.对D中弧染色来说,不存在长为4的2色有向路.并定义了有向图D的SAS-全色数,记为(D).用构造染色的方法给出了一些特殊有向图(有向路,有向圈,定向轮,定向扇,有向双星)的SAS-全色数. 相似文献
108.
Behnam Khosravi 《代数通讯》2018,46(7):3006-3013
For a finite monoid S, let ν(S) (νd(S)) denote the least number n such that there exists a graph (directed graph) Γ of order n with End(Γ)?S. Also let rank(S) be the smallest number of elements required to generate S. In this paper, we use Cayley digraphs of monoids, to connect lower bounds of ν(S) (νd(S)) to the lower bounds of rank(S). On the other hand, we connect upper bounds of rank(S) to upper bounds of ν(S) (νd(S)). 相似文献
109.
Agnieszka Görlich 《Discrete Mathematics》2010,310(4):681-686
Let TTn be a transitive tournament on n vertices. It is known Görlich, Pil?niak, Wo?niak, (2006) [3] that for any acyclic oriented graph of order n and size not greater than , two graphs isomorphic to are arc-disjoint subgraphs of TTn. In this paper, we consider the problem of embedding of acyclic oriented graphs into their complements in transitive tournaments. We show that any acyclic oriented graph of size at most is embeddable into all its complements in TTn. Moreover, this bound is generally the best possible. 相似文献
110.
We prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning 2-strong tournament. Our proof is constructive and implies a polynomial algorithm for finding a spanning 2-strong tournament in a given 3-strong semicomplete digraph. We also show that there are infinitely many (2k−2)-strong semicomplete digraphs which contain no spanning k-strong tournament and conjecture that every(2k−1)-strong semicomplete digraph which is not the complete digraph on 2k vertices contains a spanning k-strong tournament. 相似文献