首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1368篇
  免费   19篇
  国内免费   52篇
化学   86篇
晶体学   1篇
力学   8篇
综合类   4篇
数学   1283篇
物理学   57篇
  2023年   31篇
  2022年   28篇
  2021年   24篇
  2020年   36篇
  2019年   59篇
  2018年   31篇
  2017年   26篇
  2016年   12篇
  2015年   20篇
  2014年   39篇
  2013年   114篇
  2012年   32篇
  2011年   98篇
  2010年   89篇
  2009年   145篇
  2008年   138篇
  2007年   77篇
  2006年   77篇
  2005年   31篇
  2004年   36篇
  2003年   42篇
  2002年   31篇
  2001年   27篇
  2000年   24篇
  1999年   15篇
  1998年   24篇
  1997年   13篇
  1996年   16篇
  1995年   14篇
  1994年   7篇
  1993年   8篇
  1992年   9篇
  1991年   7篇
  1990年   5篇
  1989年   3篇
  1988年   3篇
  1987年   1篇
  1986年   12篇
  1985年   6篇
  1984年   6篇
  1983年   3篇
  1982年   6篇
  1981年   5篇
  1980年   2篇
  1979年   1篇
  1978年   3篇
  1977年   2篇
  1972年   1篇
排序方式: 共有1439条查询结果,搜索用时 31 毫秒
121.
Toll convexity is a variation of the so-called interval convexity. A tolled walk T between two non-adjacent vertices u and v in a graph G is a walk, in which u is adjacent only to the second vertex of T and v is adjacent only to the second-to-last vertex of T. A toll interval between u,vV(G) is a set TG(u,v)={xV(G):x lies on a tolled walk between u and v}. A set S?V(G) is toll convex, if TG(u,v)?S for all u,vS. A toll closure of a set S?V(G) is the union of toll intervals between all pairs of vertices from S. The size of a smallest set S whose toll closure is the whole vertex set is called a toll number of a graph G, tn(G). The first part of the paper reinvestigates the characterization of convex sets in the Cartesian product of two graphs. It is proved that the toll number of the Cartesian product of two graphs equals 2. In the second part, the toll number of the lexicographic product of two graphs is studied. It is shown that if H is not isomorphic to a complete graph, tn(G°H)3?tn(G). We give some necessary and sufficient conditions for tn(G°H)=3?tn(G). Moreover, if G has at least two extreme vertices, a complete characterization is given. Furthermore, graphs with tn(G°H)=2 are characterized. Finally, the formula for tn(G°H) is given — it is described in terms of the so-called toll-dominating triples or, if H is complete, toll-dominating pairs.  相似文献   
122.
Let G be a graph and f:GG be a continuous map. Denote by P(f), R(f) and Ω(f) the sets of periodic points, recurrent points and non-wandering points of f, respectively. In this paper we show that: (1) If L=(x,y) is an open arc contained in an edge of G such that {fm(x),fk(y)}⊂(x,y) for some m,kN, then R(f)∩(x,y)≠∅; (2) Any isolated point of P(f) is also an isolated point of Ω(f); (3) If xΩ(f)−Ω(fn) for some nN, then x is an eventually periodic point. These generalize the corresponding results in W. Huang and X. Ye (2001) [9] and J. Xiong (1983, 1986) [17] and [19] on interval maps or tree maps.  相似文献   
123.
In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.  相似文献   
124.
Graph sandwich problems were introduced by Golumbic et al. (1994) in [12] for DNA physical mapping problems and can be described as follows. Given a property Π of graphs and two disjoint sets of edges E1, E2 with E1E2 on a vertex set V, the problem is to find a graph G on V with edge set Es having property Π and such that E1EsE2.In this paper, we exhibit a quasi-linear reduction between the problem of finding an independent set of size k≥2 in a graph and the problem of finding a sandwich homogeneous set of the same size k. Using this reduction, we prove that a number of natural (decision and counting) problems related to sandwich homogeneous sets are hard in general. We then exploit a little further the reduction and show that finding efficient algorithms to compute small sandwich homogeneous sets would imply substantial improvement for computing triangles in graphs.  相似文献   
125.
We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at most |E(G)| steps builds a new graph G without proper and homogeneous pairs of cliques, and such that G and G agree on the value of some relevant invariant (or property).  相似文献   
126.
A fixed point detection theorem for a family of maps defined on the once punctured torus is proved. As a consequence, we produce an example of a homotopy class [f] of self-maps on the once punctured torus that illustrates the following: (i) there is a map in the homotopy class that has no fixed points, and (ii) if the image of f lies in a 1-complex that embeds as a homotopy equivalence, then f must have a fixed point.  相似文献   
127.
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices vi and vj in V(G) of G, recall that G+vivj is the supergraph formed from G by adding an edge between vertices vi and vj. Denote the Harary index of G and G+vivj by H(G) and H(G+vivj), respectively. We obtain lower and upper bounds on H(G+vivj)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.  相似文献   
128.
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called “greedy routing” based on the “virtual” coordinates of the nodes derived from the embedding.  相似文献   
129.
Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edge-ratio is NP-complete.  相似文献   
130.
In this global world, many firms present a complex shareholding structure with indirect participation, such that it may become difficult to assess a firm’s controllers. Furthermore, if there are numerous dominant shareholders, the control can be shared between them. Determining who has the most influence is often a difficult task. To measure this influence, game theory allows the modeling of voting games and the computing of the Banzhaf index. This paper firstly offers a new algorithm to compute this index in all structures and then suggests some modelisations of the floating shareholder. Then, our model is applied to a real case study: the French group Lafarge. This exemplary case demonstrates how the float’s structure and hidden coalition can impact the power relationship between dominant shareholders.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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