全文获取类型
| 收费全文 | 292篇 |
| 免费 | 7篇 |
| 国内免费 | 14篇 |
专业分类
| 力学 | 5篇 |
| 综合类 | 11篇 |
| 数学 | 289篇 |
| 物理学 | 8篇 |
出版年
| 2024年 | 2篇 |
| 2023年 | 2篇 |
| 2022年 | 7篇 |
| 2021年 | 2篇 |
| 2020年 | 14篇 |
| 2019年 | 7篇 |
| 2018年 | 8篇 |
| 2017年 | 13篇 |
| 2016年 | 6篇 |
| 2015年 | 4篇 |
| 2014年 | 6篇 |
| 2013年 | 22篇 |
| 2012年 | 6篇 |
| 2011年 | 13篇 |
| 2010年 | 18篇 |
| 2009年 | 29篇 |
| 2008年 | 21篇 |
| 2007年 | 9篇 |
| 2006年 | 27篇 |
| 2005年 | 11篇 |
| 2004年 | 7篇 |
| 2003年 | 8篇 |
| 2002年 | 13篇 |
| 2001年 | 7篇 |
| 2000年 | 10篇 |
| 1999年 | 9篇 |
| 1998年 | 6篇 |
| 1997年 | 6篇 |
| 1996年 | 4篇 |
| 1995年 | 2篇 |
| 1994年 | 3篇 |
| 1993年 | 1篇 |
| 1992年 | 2篇 |
| 1991年 | 2篇 |
| 1988年 | 1篇 |
| 1983年 | 2篇 |
| 1980年 | 1篇 |
| 1979年 | 2篇 |
排序方式： 共有313条查询结果，搜索用时 15 毫秒
101.
Let D be a digraph with vertex set and arc set . A vertex x is a k‐king of D, if for every , there is an ‐path of length at most k. A subset N of is k‐independent if for every pair of vertices , we have and ; it is l‐absorbent if for every there exists such that . A ‐kernel of D is a k‐independent and l‐absorbent subset of . A k‐kernel is a ‐kernel. A digraph D is k‐quasitransitive, if for any path of length k, x0 and are adjacent. In this article, we will prove that a k‐quasitransitive digraph with has a k‐king if and only if it has a unique initial strong component and the unique initial strong component is not isomorphic to an extended ‐cycle where each has at least two vertices. Using this fact, we show that every strong k‐quasitransitive digraph has a ‐kernel. 相似文献
102.
Switching about a vertex in a digraph means to reverse the direction of every edge incident with that vertex. Bondy and Mercier introduced the problem of whether a digraph can be reconstructed up to isomorphism from the multiset of isomorphism types of digraphs obtained by switching about each vertex. Since the largest known nonreconstructible oriented graphs have eight vertices, it is natural to ask whether there are any larger nonreconstructible graphs. In this article, we continue the investigation of this question. We find that there are exactly 44 nonreconstructible oriented graphs whose underlying undirected graphs have maximum degree at most 2. We also determine the full set of switching‐stable oriented graphs, which are those graphs for which all switchings return a digraph isomorphic to the original. 相似文献
103.
Ber-Lin Yu Ting-Zhu Huang Hong Cheng Dongdong Wang 《Linear and Multilinear Algebra》2013,61(7):853-859
104.
A two-colored digraph D is primitive if there exist nonnegative integers h and k with h+k>0 such that for each pair (i, j) of vertices there exists an (h, k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is the minimum value of h+k taken over all such h and k. In this article, we consider special primitive two-colored digraphs whose uncolored digraph has n+s vertices and consist of one n-cycle and one (n???2)-cycle. We give the bounds on the exponents, and the characterizations of the extremal two-colored digraphs. 相似文献
105.
Salman Ghazal 《Journal of Graph Theory》2012,71(1):89-94
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out‐neighborhood is at most as large as its second out‐neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted version holds for tournaments missing a sun, star, or a complete graph. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:89–94, 2012 相似文献
106.
We study the class of 1‐perfectly orientable graphs, that is, graphs having an orientation in which every out‐neighborhood induces a tournament. 1‐perfectly orientable graphs form a common generalization of chordal graphs and circular arc graphs. Even though they can be recognized in polynomial time, little is known about their structure. In this article, we develop several results on 1‐perfectly orientable graphs. In particular, we (i) give a characterization of 1‐perfectly orientable graphs in terms of edge clique covers, (ii) identify several graph transformations preserving the class of 1‐perfectly orientable graphs, (iii) exhibit an infinite family of minimal forbidden induced minors for the class of 1‐perfectly orientable graphs, and (iv) characterize the class of 1‐perfectly orientable graphs within the classes of cographs and of cobipartite graphs. The class of 1‐perfectly orientable cobipartite graphs coincides with the class of cobipartite circular arc graphs. 相似文献
107.
Aigner and Fromme initiated the systematic study of the cop number of a graph by proving the elegant and sharp result that in every connected planar graph, three cops are sufficient to win a natural pursuit game against a single robber. This game, introduced by Nowakowski and Winkler, is commonly known as Cops and Robbers in the combinatorial literature. We extend this study to directed planar graphs, and establish separation from the undirected setting. We exhibit a geometric construction that shows that a sophisticated robber strategy can indefinitely evade three cops on a particular strongly connected planar‐directed graph. 相似文献
108.
S. P. Strunkov 《Mathematical Notes》2006,80(3-4):590-592
We prove that any set of pair-wise nonisomorphic strongly connected weakly cospectral pseudodigraphs whose set of nilpotency indices is finite also is finite. 相似文献
109.
110.
John B. Kervin 《The Journal of mathematical sociology》2013,37(2):199-214
Our status‐related behavior toward others is a function of the characteristics we perceive them to possess. Expectation states theory specifies the nature of the relationship between social characteristics and behavior, but until recently was limited to situations in which only one characteristic is perceived. This paper adds to the theory additional general assumptions from which an information‐combining model is derived. This model specifies status‐related behavior in multiple characteristic situations and other circumstances beyond the original scope of the theory. Comparisons of the model with other formulations provide excellent support. 相似文献