Results 221 to 230 of about 285,330 (265)

Factors and Connected Induced Subgraphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Binding Numbers and Connected Factors

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Component Factors and Connected Factors

2009
Graph 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

External Factor Variable Connectivity Index

Journal of Chemical Information and Computer Sciences, 2003
A 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, Yi-Zeng Liang, Ya-Li Wang, Cheng-Jian Xu, Zhong-Da Zeng, Kai-Tai Fang, Xiao-Ling Peng, Hong Yin   +7 more
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, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki   +3 more
openaire   +1 more source

Connected Factors and Spanning Trees in Graphs

Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taro Tokuda, Baoguang Xu, Jianfang Wang
openaire   +2 more sources

Growth Factors and Neural Connectivity

1996
The 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

Factorization and circuit in the connection method

Journal of the ACM, 1993
Summary: A means of combining several search-space pruning rules, including factorization and circuit, into \textit{W. Bibel}'s connection method, is considered.
openaire   +1 more source

Embedding connected factorizations II

Journal of Combinatorial Theory, Series B
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Bahmanian, Anna Johnsen-Yu
openaire   +2 more sources

Kinetic Steric Factors and Connectivity Indices

Journal of Pharmaceutical Sciences, 1984
In this study the relationships between previously reported connectivity indices described by Kier and Hall and steric contributions to the rate constants for several series of reactions are examined. Rate data were examined for four different series of reactions, which were chosen to represent a range of different reaction mechanisms and transition ...
J C, Schug, J W, Viers, J I, Seeman
openaire   +2 more sources