全文获取类型
收费全文 | 104篇 |
免费 | 5篇 |
国内免费 | 6篇 |
专业分类
综合类 | 1篇 |
数学 | 37篇 |
物理学 | 1篇 |
综合类 | 76篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 3篇 |
2014年 | 5篇 |
2013年 | 5篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 6篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有115条查询结果,搜索用时 15 毫秒
21.
王冬冬 《徐州师范大学学报(自然科学版)》1997,(4)
设G是n阶3-连通无向简单图,α表示图的独立数.若对G的所有距离为2的顶点u,v,都有d(u)+d(v)≥n或|N(u)∩N(v)|≥α,则G是Hamilton连通的,除非G属于一个特殊图类. 相似文献
22.
For a graph G, let diff(G) = p(G) − c(G), where p(G) and c(G) denote the orders of a longest path and a longest cycle in G, respectively. Let G be a 3-connected graph of order n. In the paper, we give a best-possible lower bound to σ4(G) to assure diff(G) ≤ 1. The result settles a conjecture in J. Graph Theory 37 (2001), 137–156. 相似文献
23.
Understanding chicken walks on n × n grid: Hamiltonian paths,discrete dynamics,and rectifiable paths
下载免费PDF全文
![点击此处可从《Mathematical Methods in the Applied Sciences》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Arni S.R. Srinivasa Rao Fiona Tomley Damer Blake 《Mathematical Methods in the Applied Sciences》2015,38(15):3346-3358
Understanding animal movements and modeling the routes they travel can be essential in studies of pathogen transmission dynamics. Pathogen biology is also of crucial importance, defining the manner in which infectious agents are transmitted. In this article, we investigate animal movement with relevance to pathogen transmission by physical rather than airborne contact, using the domestic chicken and its protozoan parasite Eimeria as an example. We have obtained a configuration for the maximum possible distance that a chicken can walk through straight and nonoverlapping paths (defined in this paper) on square grid graphs. We have obtained preliminary results for such walks which can be practically adopted and tested as a foundation to improve understanding of nonairborne pathogen transmission. Linking individual nonoverlapping walks within a grid‐delineated area can be used to support modeling of the frequently repetitive, overlapping walks characteristic of the domestic chicken, providing a framework to model fecal deposition and subsequent parasite dissemination by fecal/host contact. We also pose an open problem on multiple walks on finite grid graphs. These results grew from biological insights and have potential applications. © 2014 The Authors. Mathematical Methods in the Applied Sciences published by John Wiley & Sons Ltd. 相似文献
24.
For a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, respectively. In this paper, we prove that if G is a 3 ‐connected graph of order n such that the minimum degree sum of four independent vertices is at least n+ 6, then p(G)?c(G)?2. By considering our result and the results in [J Graph Theory 20 (1995), 213–225; Amer Math Monthly 67 (1950), 55], we propose a conjecture which is a generalization of Bondy's conjecture. Furthermore, using our result, for a graph satisfying the above conditions, we obtain a new lower bound of the circumference and establish Thomassen's conjecture. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 279–291, 2009 相似文献
25.
《Journal of Graph Theory》2018,87(3):374-393
In this article, we consider the following problem proposed by Locke and Zhang in 1991: Let G be a k‐connected graph with minimum degree d and X a set of m vertices on a cycle of G. For which values of m and k, with , must G have a cycle of length at least passing through X? Fujisawa and Yamashita solved this problem for the case and in 2008. We provide an affirmative answer to this problem for the case of and . 相似文献
26.
张国枢 《安徽理工大学学报(自然科学版)》1993,(3)
本文应用计算机模拟的方法讨论了采掘工作面布局(网路结构)及其风量分配和关键路线上分支的通风参数等因素对通风系统总风阻的影响。进而指出,合理安排采掘工作面、合理配风以使网路中各个通路的阻力尽可能接近;尽量缩短关键路线长度;减小关键路线上非用风分支的风阻或风量,是降低矿井总风阻的主要途径。 相似文献
27.
研究同构并行机上的批在线调度问题,目标函数是使最大完成时间(最后一个工件的完成时间makespan)最小.工件以批方式到达且每个批中有m个工件,每个工件的加工时间随其批的到达而给定且限定在某个时间区间上.当一批工件到达时,在对其后批的信息不了解的情况下,要立即对该批中的工件进行调度,调度过程中不允许中断.针对这一问题,给出了一个批在线启发式列表调度算法,在同一批中的工件按LPT规则调度,当一批中的全部工件被调度完后,调度下一批中的工件.对算法的最坏情况进行了分析并给出了算法的竞争率. 相似文献
28.
设G=(V, E; w)为赋权图,定义G中点v的权度dGw(v)为G中与v相关联的所有边的权和.该文证明了下述定理: 假设G为满足下列条件的2 -连通赋权图: (i) 对G中任何导出路xyz都有w(xy)=w(yz); (ii)对G中每一个与K1,3或K1,3+e同构的导出子图T, T中所有边的权都相等并且min{max{dGw(x), dwG(y)}:d(x,y)=2,x,y∈ V(T)}≥ c/2. 那么, G中存在哈密尔顿圈或者存在权和至少为 c 的圈. 该结论分别推广了Fan[5], Bedrossian等人[2]和Zhang等人[7]的相关定理 相似文献
29.
如果G中任意s个点的导出子图中至少含有t条边,则称G为[s,t]图.文中证明了:阶数不小于6的连通[5,3]图的最长路的长度不小于n-2,且路长的界是紧的,其最长圈的长度可任意小. 相似文献
30.