全文获取类型
收费全文 | 256篇 |
免费 | 0篇 |
国内免费 | 19篇 |
专业分类
化学 | 6篇 |
力学 | 9篇 |
数学 | 250篇 |
物理学 | 10篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 10篇 |
2017年 | 3篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 17篇 |
2012年 | 13篇 |
2011年 | 15篇 |
2010年 | 10篇 |
2009年 | 17篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 6篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 2篇 |
1969年 | 3篇 |
排序方式: 共有275条查询结果,搜索用时 15 毫秒
221.
222.
《Discrete Mathematics》2022,345(4):112774
Chvátal and Erdös (1972) [5] proved that, for a k-connected graph G, if the stability number , then G is Hamilton-connected () or Hamiltonian () or traceable (). Motivated by the result, we focus on tight sufficient spectral conditions for k-connected graphs to possess Hamiltonian s-properties. We say that a graph possesses Hamiltonian s-properties, which means that the graph is Hamilton-connected if , Hamiltonian if , and traceable if .For a real number , and for a k-connected graph G with order n, degree diagonal matrix and adjacency matrix , we have identified best possible upper bounds for the spectral radius , where Γ is either G or the complement of G, to warrant that G possesses Hamiltonian s-properties. Sufficient conditions for a graph G to possess Hamiltonian s-properties in terms of upper bounds for the Laplacian spectral radius as well as lower bounds of the algebraic connectivity of G are also obtained. Other best possible spectral conditions for Hamiltonian s-properties are also discussed. 相似文献
223.
Tong Li Zi-Xia Song Guanghui Wang Donglei Yang Cun-Quan Zhang 《Journal of Graph Theory》2019,90(1):46-53
A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to . A labeling of D is antimagic if no two vertices in D have the same vertex-sum, where the vertex-sum of a vertex for a labeling is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Motivated by the conjecture of Hartsfield and Ringel from 1990 on antimagic labelings of graphs, Hefetz, Mütze, and Schwartz [On antimagic directed graphs, J. Graph Theory 64 (2010) 219–232] initiated the study of antimagic labelings of digraphs, and conjectured that every connected graph admits an antimagic orientation, where an orientation D of a graph G is antimagic if D has an antimagic labeling. It remained unknown whether every disjoint union of cycles admits an antimagic orientation. In this article, we first answer this question in the positive by proving that every 2-regular graph has an antimagic orientation. We then show that for any integer , every connected, 2d-regular graph has an antimagic orientation. Our technique is new. 相似文献
224.
Nicole Engelke Infante Kristen Murphy Celeste Glenn Vicki Sealey 《International Journal of Mathematical Education in Science & Technology》2018,49(5):643-659
Knowing when students have the prerequisite knowledge to be able to read and understand a mathematical text is a perennial concern for instructors. Using text describing Newton's method and Vinner's notion of concept image, we exemplify how prerequisite knowledge influences understanding. Through clinical interviews with first-semester calculus students, we determined how evoked concept images of tangent lines and roots contributed to students’ interpretation and application of Newton's method. Results show that some students’ concept images of root and tangent line developed throughout the interview process, and most students were able to adequately interpret the text on Newton's method. However, students with insufficient concept images of tangent line and students who were unwilling or unable to modify their concept images of tangent line after reading the text were not successful in interpreting Newton's method. 相似文献
225.
Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K2 or to K2,l with l odd. 相似文献
226.
《Solid State Communications》1986,57(8):691-693
A simple parameter-free model is introduced for predicting surface directivity effects in phonon imaging. The model is applicable to situations in which the metal overlayers used for phonon generation and detection are of low acoustic impedance or weakly bonded to the crystal substrate. Our phonon intensity diagrams display well-defined structures which are due to pseudosurface waves in the quasi-free crystal surface. 相似文献
227.
We show that solutions of the chemical reaction-diffusion system associated to \(A+B\rightleftharpoons C\) in one spatial dimension can be approximated in \(L^2\) on any finite time interval by solutions of a space discretized ODE system which models the corresponding chemical reaction system replicated in the discretization subdomains where the concentrations are assumed spatially constant. Same-species reactions through the virtual boundaries of adjacent subdomains lead to diffusion in the vanishing limit. We show convergence of our numerical scheme by way of a consistency estimate, with features generalizable to reaction networks other than the one considered here, and to multiple space dimensions. In particular, the connection with the class of complex-balanced systems is briefly discussed here, and will be considered in future work. 相似文献
228.
Acta Mathematicae Applicatae Sinica, English Series - Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the... 相似文献
229.
一个有向多重图D的跳图$J(D)$是一个顶点集为$D$的弧集,其中$(a,b)$是$J(D)$的一条弧当且仅当存在有向多重图$D$中的顶点$u_1$, $v_1$, $u_2$, $v_2$,使得$a=(u_1,v_1)$, $b=(u_2,v_2)$ 并且$v_1\neq u_2$.本文刻画了有向多重图类$\mathcal{H}_1$和$\mathcal{H}_2$,并证明了一个有向多重图$D$的跳图$J(D)$是强连通的当且仅当$D\not\in \mathcal{H}_1$.特别地, $J(D)$是弱连通的当且仅当$D\not\in \mathcal{H}_2$.进一步, 得到以下结果: (i) 存在有向多重图类$\mathcal{D}$使得有向多重图$D$的强连通跳图$J(D)$是强迹连通的当且仅当$D\not\in\mathcal{D}$. (ii) 每一个有向多重图$D$的强连通跳图$J(D)$是弱迹连通的,因此是超欧拉的. (iii) 每一个有向多重图D的弱连通跳图$J(D)$含有生成迹. 相似文献
230.
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,?1} matrix having one row for each biclique and one column for each vertex of G, and such that a pair of 1, ?1 entries in a same row corresponds exactly to adjacent vertices in the corresponding biclique. We describe a characterization of biclique matrices, in similar terms as those employed in Gilmore's characterization of clique matrices. On the other hand, the biclique graph of a graph is the intersection graph of the bicliques of G. Using the concept of biclique matrices, we describe a Krausz‐type characterization of biclique graphs. Finally, we show that every induced P3 of a biclique graph must be included in a diamond or in a 3‐fan and we also characterize biclique graphs of bipartite graphs. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 1–16, 2010 相似文献