scholarly journals ACYLINDRICAL HYPERBOLICITY OF ARTIN–TITS GROUPS ASSOCIATED WITH TRIANGLE-FREE GRAPHS AND CONES OVER SQUARE-FREE BIPARTITE GRAPHS

2020 ◽  
pp. 1-14
Author(s):  
MOTOKO KATO ◽  
SHIN-ICHI OGUNI
Keyword(s):  
Bipartite Graphs ◽  
Large Type ◽  
Central Quotient ◽  
Tits Group

Abstract It is conjectured that the central quotient of any irreducible Artin–Tits group is either virtually cyclic or acylindrically hyperbolic. We prove this conjecture for Artin–Tits groups that are known to be CAT(0) groups by a result of Brady and McCammond, that is, Artin–Tits groups associated with graphs having no 3-cycles and Artin–Tits groups of almost large type associated with graphs admitting appropriate directions. In particular, the latter family contains Artin–Tits groups of large type associated with cones over square-free bipartite graphs.

Ultrastructural Alterations in Sinusoidal Endothelial Fenestrae as a Result of Hypoxia

1976 ◽  
Vol 34 ◽  
pp. 168-169
Author(s):  
Waykin Nopanitaya ◽  
Raeford E. Brown ◽  
Joe W. Grisham ◽  
Johnny L. Carson
Keyword(s):  
Endothelial Cells ◽  
Experimental Model ◽  
Hepatic Lobule ◽  
Ultrastructural Alterations ◽  
Large Type ◽  
Sinusoidal Endothelial Fenestrae ◽  
General Size ◽  
Sem Studies

Mammalian endothelial cells lining hepatic sinusoids have been found to be widely fenestrated. Previous SEM studies (1,2) have noted two general size catagories of fenestrations; large fenestrae were distributed randomly while the small type occurred in groups. These investigations also reported that large fenestrae were more numerous and larger in the endothelial cells at the afferent ends of sinusoids or around the portal areas, whereas small fenestrae were more numerous around the centrilobular portion of the hepatic lobule. It has been further suggested that under some physiologic conditions small fenestrae could fuse and subsequently become the large type, but this is, as yet, unproven.We have used a reproducible experimental model of hypoxia to study the ultrastructural alterations in sinusoidal endothelial fenestrations in order to investigate the origin of occurrence of large fenestrae.

Bipartite Graphs and their Applications

1998 ◽  
Author(s):  
Armen S. Asratian ◽  
Tristan M. J. Denley ◽  
Roland Häggkvist
Keyword(s):  
Bipartite Graphs

Hurricane in Bipartite Graphs: The Lethal Nodes of Butterflies

2020 ◽  
Author(s):  
Qiuyu Zhu ◽  
Jiahong Zheng ◽  
Hao Yang ◽  
Chen Chen ◽  
Xiaoyang Wang ◽  
...  
Keyword(s):  
Bipartite Graphs

Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150

2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang
Keyword(s):  
Automorphism Group ◽  
Bipartite Graphs ◽  
Type Ii ◽  
Symmetric Graph ◽  
Trivalent Graph ◽  
Block Graphs ◽  
Group A ◽  
Vertex Transitive ◽  
Vertex Transitive Graphs ◽  
Transitive Graphs

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

Sign in / Sign up

Export Citation Format

Share Document