Results 301 to 310 of about 976,099 (318)

Algebraic Model for N-Connection

AIP Conference Proceedings, 2011
We construct the cochain N‐complex by means of an associative unital graded algebra and prove that the generalized cohomologies of this cochain N‐complex are trivial. We also show that this cochain N‐complex can be endowed with the strucure of graded q‐differential algebra.
Viktor Abramov, Olga Liivapuu, Theodore E. Simos, George Psihoyios, Ch. Tsitouras, Zacharias Anastassi   +5 more
openaire   +1 more source

Spanning k-Trees of n-Connected Graphs

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kano, Mikio, Kishimoto, Hiroo
openaire   +2 more sources

A characterization of n-connected splitting matroids

Asian-European Journal of Mathematics, 2014
The splitting operation on an n-connected binary matroid may not yield an n-connected binary matroid. In this paper, we characterize n-connected binary matroids which yield n-connected binary matroids by the generalized splitting operation.
Malavadkar, P. P., Shikare, M. M., Dhotre, S. B.   +2 more
openaire   +2 more sources

On Infinite n-Connected Graphs

1990
Every infinite, (n+l)-connected graph G contains an infinite subset S ⊆ V(G) such that for all S’ S, G — S’ is n-connected. Every infinite, critically (n+l)-connected graph G has a subset S ⊆ V(G) of cardinality ❘V(GV(G)❘ such that for all S’ ⊆ S, G — S’ is n-connected.
openaire   +1 more source

High Connectivity Keeping Sets In n-Connected Graphs

COMBINATORICA, 2004
This paper is a contribution to the theory of graph connectivity. The main theorem is that, for each positive integer \(k\), if \(G\) is a graph with vertex-connectivity \(\kappa(G)= n\) which is of sufficiently large order \(h_{n}(k)\), then there is a set \(W\) of \(k\) vertices such that \(G\backslash W\) is \((n-2)\)-connected.
openaire   +1 more source

An Evolutionary Computational Method for N-Connection Subgraph Discovery

2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
The problem of n-connection subgraph discovery (n-CSDP for short) is to find a small sized subgraph that can well capture the relationship among the n given nodes in a large graph. However there have been very few researches directly addressing the CSDP problem.
Enhong Chen, Xujia Chen, Phillip Sheu, Tieyun Qian   +3 more
openaire   +1 more source