Results 261 to 270 of about 125,344 (284)

Partitioning a graph into vertex-disjoint paths

Studia Scientiarum Mathematicarum Hungarica, 2005
Let G=(V,E) be a simple graph of order n. We consider the problem of partitioning G into vertex-disjoint paths. We obtain the following new results: (i) For any positive integer k, if dG(x)+dG(y) = n-k-1 for every pair x, y of nonadjacent vertices in  G, then G can be partitioned into k vertex-disjoint paths, unless G belongs to certain classes of ...
Jianping Li, George Steiner
openaire   +1 more source

Optimal Vertex Partitions

Bulletin of the London Mathematical Society, 1979
Bollobas, Bela, Manvel, Bennet
openaire   +2 more sources

Exploiting Vertex-Cut Partitioning in Distributed Graph Generation

Graphs sub-structures have strong influence on the characteristics of real-world complex networks. Moreover, graph generation algorithms must capture and replicate these characteristics to remain representative of their real-world counterparts. The ever-increasing size of data collected from observed networks introduces another layer of complexity ...
Atas, Furkan, Akgun, Mehmet Burak
openaire   +2 more sources

Necessary and sufficient vertex partition conditions for input–output decoupling of Boolean control networks

Automatica, 2022
Yi-feng Li, Jian-dong Zhu
exaly  

Results on the realization of Boolean control networks by the vertex partition method

Science China Information Sciences, 2023
Jian-dong Zhu, Yi-feng Li
exaly  

Sharp bounds on partition dimension of hexagonal Möbius ladder

Journal of King Saud University - Science, 2022
Muhammad Azeem, Muhammad Faisal Nadeem
exaly  

Linear Time Vertex Partitioning on Massive Graphs.

International journal of computer science (Rabat)
The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techniques that function on up to thousands of nodes.
Peter, Mell, Richard, Harang, Assane, Gueye   +2 more
openaire   +1 more source

Domain wall partition function of the eight-vertex model with a non-diagonal reflecting end

Nuclear Physics B, 2011
Wen-Li Yang, Jun Feng, Kun Hao
exaly  

On the vertex partition of planar graphs into forests with bounded degree

Applied Mathematics and Computation, 2020
Danjun Huang
exaly  

A VERTEX PARTITIONING OF A GRAPH

Proceedings of the Third Asian Mathematical Conference 2000, 2002
SERGIO R. CANOY, ESPERANZA B. ARUGAY, ESAMEL M. PALUGA   +2 more
openaire   +1 more source