理学 >>> 数学 >>> 运筹学 >>> 图论 >>>
搜索结果: 16-30 共查到知识库 图论相关记录301条 . 查询时间(1.171 秒)
A graph is K2,3-saturated if it has no subgraph isomorphic to K2,3, but does contain a K2,3 after the addition of any new edge. We prove that the minimum number of edges in a K2,3-saturated graph on n...
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex gra...
Let D be a directed graph with vertex set V and order n. An anti-directed (hamiltonian) cycle H in D is a (hamiltonian) cycle in the graph underlying D such that no pair of consecutive arcs in H form ...
We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided K5 or a K−4 (= K4 with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu tha...
The Kelmans-Seymour conjecture states that the 5-connected nonplanar graphs contain a subdivided K5 .
W-graph ideals      W-graph ideals        2011/1/18
We introduce a concept of a W- graph ideal in a Coxeter group.The main goal of this paper is to describe how to construct a W- graph from a given W- graph ideal. The principal application of this idea...
Starting from approximate Skyrmion solutions obtained using the rational map ansatz, improved approximate Skyrmions are constructed using scaling arguments.Although the energy improvement is small, th...
We provide a new natural interpretation of the Lax representation for an integrable system; that is, the spectral problem is the linearized form of a Miura transformation between the original system a...
A conjecture of I. H´avel asserts that all middle-levels graphs Mk of the (2k + 1)-cubes possess Hamilton cycles. In this work, a tree containing all vertices of certain reduced graphs of the Mk...
The space Hhyp(4) consists of pairs (M, ω), whereM is a hyper-elliptic Riemann surface of genus 3, and ω is a holomorphic 1-form having only one zero, which is located at a Weierstrass point of M.
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ℓ of edge-disjoint trees T1, T2, . . . , T...
Cohen-Macaulayness of bipartite graphs is investigated by several mathematicians and has been characterized combinatorially. In this note, we give some different combi-natorial conditions for a bipart...
Предложен новый взгляд на классификацию бифуркационных диаграмм и условия существования критических движений интегрируемой задачи о движении тяжелого гиростата при условиях типа Кова-левской (случай и...
In this paper we prove that any distance-balanced graph G with (G)  |V (G)| − 3 is regular. Also we define notion of distance-balanced closure of a graph and we find distance- balanced closur...
The Gompertz model describes the growth in time of the size of significant quantities associated to a large number of systems, taking into account nonlinearity features by a linear equation satisfied ...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...