搜索结果: 1-15 共查到“数学 k-connectivity”相关记录26条 . 查询时间(0.097 秒)
Workshop on Colored Notions of Connectivity in Graphs
Workshop Colored Notions of Connectivity in Graphs
2017/1/11
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. ...
LOCAL CONNECTIVITY OF JULIA SETS AND BIFURCATION LOCI:THREE THEOREMS OF J.-C. YOCCOZ
LOCAL CONNECTIVITY JULIA SETS BIFURCATION LOCI THREE THEOREMS OF J.-C. YOCCOZ
2015/8/26
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.
Upper bounds on algebraic connectivity via convex optimization
Laplace operator matrix algebra connection Laplacian invariant subset matrix convex function
2015/8/10
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
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...
Combined degree and connectivity conditions for H-linked graphs
Combined degree connectivity conditions H-linked graphs Combinatorics
2012/6/27
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...
Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices
Cantor distribution connectivity threshold random geometric graph singular distributions
2012/4/18
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...
On rainbow-k-connectivity of random graphs
Rainbow connectivity Random graph Graph algorithms Sharp threshold function Probabilistic method
2012/12/4
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...
Maximum spectral radius of graphs with given connectivity and minimum degree
connectivity spectral radius Combinatorics
2011/9/21
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) \...
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 ...
On augmented eccentric connectivity index of graphs and trees
eccentric connectivity index Combinatorics graphs and trees
2011/9/2
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. ...
Note on a relation between Randic index and algebraic connectivity
Randi´ c index algebraic connectivity edge connectivity diameter
2011/2/24
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 ...
Connectivity statistics of store-and-forward inter-vehicle communication
Connectivity statistics store-and-forward inter-vehicle communication
2010/12/28
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...
The generalized connectivity of complete bipartite graphs
k-connectivity complete bipartite graph edge-disjoint spanning trees
2011/2/28
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...
Connectivity properties of random interlacement and intersection of random walks
Random interlacement random walk intersection of random walks capacity
2011/2/24
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...
Information theoretic interpretation of frequency domain connectivity measures
Information theoretic interpretation frequency domain connectivity measures
2011/1/17
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...