首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   248篇
  免费   2篇
  国内免费   19篇
化学   4篇
力学   9篇
数学   248篇
物理学   8篇
  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年   2篇
  1987年   4篇
  1986年   2篇
  1985年   3篇
  1984年   5篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1980年   2篇
  1978年   2篇
  1977年   1篇
  1973年   1篇
  1971年   1篇
  1970年   2篇
  1969年   3篇
排序方式: 共有269条查询结果,搜索用时 109 毫秒
221.
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  相似文献   
222.
Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,YE(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+tk−1. We further show that if s+tk and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,YE(G) with |X|≤s and |Yt, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if GY is not contractible to K2 or to K2,l with l odd.  相似文献   
223.
224.
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.  相似文献   
225.
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...  相似文献   
226.
Error estimates for matrix-valued radial basis function interpolation   总被引:2,自引:0,他引:2  
We introduce a class of matrix-valued radial basis functions (RBFs) of compact support that can be customized, e.g. chosen to be divergence-free. We then derive and discuss error estimates for interpolants and derivatives based on these matrix-valued RBFs.  相似文献   
227.
Group Chromatic Number of Graphs without K5-Minors   总被引:2,自引:0,他引:2  
 Let G be a graph with a fixed orientation and let A be a group. Let F(G,A) denote the set of all functions f: E(G) ↦A. The graph G is A -colorable if for any function fF(G,A), there is a function c: V(G) ↦A such that for every directed e=u vE(G), c(u)−c(v)≠f(e). The group chromatic numberχ1(G) of a graph G is the minimum m such that G is A-colorable for any group A of order at least m under a given orientation D. In [J. Combin. Theory Ser. B, 56 (1992), 165–182], Jaeger et al. proved that if G is a simple planar graph, then χ1(G)≤6. We prove in this paper that if G is a simple graph without a K 5-minor, then χ1(G)≤5. Received: August 18, 1999 Final version received: December 12, 2000  相似文献   
228.
We consider the questions related to the structure of shock waves for a system of magnetohydrodynamic equations. Using Conley's connection matrix, we recover and extend earlier results due to C. Conley and J. Smoller. In particular, we give a simpler proof of the existence of fast and slow shocks with structure. We also demonstrate that for some viscosity parameters intermediate shocks occur. Furthermore, under an assumption of transversality, we show that there exist multi-parameter families of these intermediate shocks.This research was done while both authors were visiting the Lefschetz Center for Dynamical Systems at Brown University.Supported in part by the NSF under Grant DMS-8507056.Supported in part by AFOSR 87-0347.  相似文献   
229.
230.
Cyclic curves, i.e. curves fixed by a cyclic collineation group, play a central role in the investigation of cyclic arcs in Desarguesian projective planes. In this paper, the genus of a cyclic curve arising from a cyclic k-arc of Singer type is computed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号