Results 251 to 260 of about 1,357,146 (299)
Some of the next articles are maybe not open access.
Embedding connected factorizations
Journal of Combinatorial Theory, Series B, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Bahmanian +2 more
openaire +1 more source
Connected [ a , b ]-factors in Graphs
Combinatorica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mekkia Kouider, Maryvonne Mahéo
openaire +1 more source
Journal of Graph Theory, 2001
AbstractIn this paper we study connected (g, f)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequence we give sufficient conditions for a graph to have a connected
Mark N. Ellingham +2 more
openaire +1 more source
AbstractIn this paper we study connected (g, f)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequence we give sufficient conditions for a graph to have a connected
Mark N. Ellingham +2 more
openaire +1 more source
External Factor Variable Connectivity Index
Journal of Chemical Information and Computer Sciences, 2003A new variable index, external factor variable connectivity index (EFVCI), is proposed, in which the atomic attribute is divided into two parts. The innate part is denoted as outer-shell electrons and external part or perturbation by other atoms is represented as summation, multiplied by a variable x, of squared reciprocal matrix of i row (corresponds ...
Qian-Nan Hu +7 more
openaire +2 more sources
Binding Numbers and Connected Factors
Graphs and Combinatorics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Factors and Connected Induced Subgraphs
Graphs and Combinatorics, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Connected Factors and Spanning Trees in Graphs
Graphs and Combinatorics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taro Tokuda, Baoguang Xu, Jianfang Wang
openaire +2 more sources
Connected odd factors of graphs [PDF]
Australas. J Comb., 2019 Summary: An odd factor of a graph is a spanning subgraph in which every vertex has odd degree. \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29--44 (1988; Zbl 0659.05073)] proved that every 4-edge-connected graph of even order has a connected odd factor. In this paper, we consider graphs of odd order, and show that for every 4-edge-connected graph \
Nastaran Haghparast +3 more
openaire +1 more source
Component Factors and Connected Factors
2009Graph factor problems have been studied extensively for many years. Most of the results mentioned in the previous chapters are of type “degree constraint factors”, i.e., finding a spanning subgraph with given degree conditions. Many of these “degree constraint factors” problems can be transformed to matching problems, and therefore there exist ...
Qinglin Roger Yu, Guizhen Liu
openaire +1 more source
Growth Factors and Neural Connectivity
1996The formation of connections in the developing nervous system requires axons to navigate through complex environments to reach their targets. It is the growth cone, a sensory and motor apparatus located at the tip of the developing axon, that senses and responds to the environment.
S, McFarlane, C E, Holt
openaire +2 more sources