๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Behavior of the connectedness of a randomGn, 1/2graph

โœ Scribed by A. S. Ambrosimov

Publisher
SP MAIK Nauka/Interperiodica
Year
1980
Tongue
English
Weight
184 KB
Volume
28
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On stability of Hamilton-connectedness u
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
โœ Zdenฤ›k Ryjรกฤek; Petr Vrรกna ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 269 KB ๐Ÿ‘ 1 views

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by Bollobรกs et al.

The relationships of antisocial behavior
The relationships of antisocial behavior with attachment styles, autonomy-connectedness, and alexithymia
โœ Marrie H. J. Bekker; Nathan Bachrach; Marcel A. Croon ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 159 KB

## Abstract The present study was aimed at investigating the relationships among attachment styles, autonomyโ€connectedness (selfโ€awareness, sensitivity to others, and capacity for managing new situations), alexithymia, and antisocial behavior among 202 college students (67 men and 135 women). We we

Nonadditivity of the 1-genus of a graph
Nonadditivity of the 1-genus of a graph
โœ Vladimir P. Korzhik ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

The 1-genus of a graph is the smallest possible genus of an orientable surface such that the graph can be drawn on the surface so that each edge is crossed over by no more than one other edge. An example with smallest number of vertices is given showing that the 1-genus of a graph is not additive, i