理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 connectivity相关记录26条 . 查询时间(0.117 秒)
Nowadays "colored notions of connectivity in graphs" becomes a new and active subject in graph theory. Starting from rainbow connection, monochromatic connection and proper connection appeared later. ...
This paper consists of three parts, each devoted to a result due to J.-C. Yoccoz.The proofs are all somewhat modied, but they are also deeply in!uenced byYoccoz's work.
The second smallest eigenvalue of the Laplacian matrix L of a graph is called its algebraic connectivity. We describe a method for obtaining an upper bound on the algebraic connectivity of a family of...
Higher connectivity of fiber graphs of Grobner bases     Higher connectivity  fiber graphs  Grobner bases       font style='font-size:12px;'> 2012/11/23
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The con...
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv i...
For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \emph{Cantor} distributed points on $[0,1]$. We show t...
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k  1, the rainbow-k-connectivity of a graph G, denoted by rck(G), is the minimum number of colors...
Abstract: Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\kappa(G) \...
Matroid 3-connectivity and branch width     Matroid 3-connectivity  branch width  Combinatorics       font style='font-size:12px;'> 2011/9/15
Abstract: We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a ...
Abstract: In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. ...
A conjecture of AutoGraphiX on the relation between the Randi´c index R and the algebraic connectivity a of a connected graph G is:R a  n − 3 + 2p2 2 ! /  2(1 − cos  n )  with ...
Inter-vehicle communication (IVC) enables vehicles to exchange messages within a limited broadcast range and thus self-organize into dynamical vehicular ad hoc networks. For the foreseeable future, h...
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...
We consider the interlacement Poisson point process on the space of doubly-infinite Zd-valued trajectories modulo time shift, tending to infinity at positive and negative infinite times. The set of v...
To provide adequate multivariate measures of information flow between neural structures, modified expressions of Partial Directed Coherence (PDC) and Directed Transfer Function (DTF), two popular mult...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...