scholarly journals A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

2016 ◽  
Vol 36 (2) ◽  
pp. 409 ◽  
Author(s):  
Zhiren Sun ◽  
Fan Yang ◽  
Sizhong Zhou
Keyword(s):  
Critical Graphs ◽  
Neighborhood Condition

scholarly journals Improvement on the Crossing Number of Crossing-Critical Graphs

2020 ◽  
Author(s):  
János Barát ◽  
Géza Tóth
Keyword(s):  
Crossing Number ◽  
Critical Graphs ◽  
Minimum Number ◽  
Edge Crossings

AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. There are examples of k-crossing-critical graphs that do not have drawings with exactly k crossings. Richter and Thomassen proved in 1993 that if G is k-crossing-critical, then its crossing number is at most $$2.5\, k+16$$ 2.5 k + 16 . We improve this bound to $$2k+8\sqrt{k}+47$$ 2 k + 8 k + 47 .

Do Released Prisoners’ Perceptions of Neighborhood Condition Affect Reentry Outcomes?

2020 ◽  
pp. 088740342098080
Author(s):  
Lin Liu ◽  
Christy A. Visher ◽  
Dayu Sun
Keyword(s):  
The United States ◽  
Neighborhood Context ◽  
Contextual Effect ◽  
Neighborhood Disorder ◽  
Regression Analyses ◽  
Research Attention ◽  
Neighborhood Cohesion ◽  
Individual Level ◽  
Profound Influence ◽  
Neighborhood Condition

As the United States enters a decarceration era, the factors predicting reentry success have received a rapidly growing body of research attention. Numerous studies expand beyond individual-level attributes to assess the contextual effect of neighborhoods to which released prisoners return. However, past studies predominantly used neighborhood structural/economic characteristics as the proxies of neighborhood context, leaving the roles of community cohesion and disorder understudied in the context of reentry. Using longitudinal data, this study examines the influence of neighborhood cohesion and disorder on reentry outcomes, represented by released prisoners’ determination to desist and social isolation. The results of linear regression analyses show that net of the effects of individual-level risk factors, released prisoners’ perception of neighborhood disorder exhibit profound influence on reentry outcomes. Implications for reentry programming and interventions are presented.

Excluding induced subgraphs: Critical graphs

2010 ◽  
Vol 38 (1-2) ◽  
pp. 100-120 ◽  
Author(s):  
József Balogh ◽  
Jane Butterfield
Keyword(s):  
Induced Subgraphs ◽  
Critical Graphs

scholarly journals Subcubic Edge-Chromatic Critical Graphs Have Many Edges

2017 ◽  
Vol 86 (1) ◽  
pp. 122-136 ◽  
Author(s):  
Daniel W. Cranston ◽  
Landon Rabern
Keyword(s):  
Critical Graphs

scholarly journals On the existence problem of the total domination vertex critical graphs

2011 ◽  
Vol 159 (1) ◽  
pp. 46-52 ◽  
Author(s):  
Moo Young Sohn ◽  
Dongseok Kim ◽  
Young Soo Kwon ◽  
Jaeun Lee
Keyword(s):  
Existence Problem ◽  
Total Domination ◽  
Critical Graphs

On all fractional (a, b, k)-critical graphs

2014 ◽  
Vol 30 (4) ◽  
pp. 696-702 ◽  
Author(s):  
Si Zhong Zhou ◽  
Zhi Ren Sun
Keyword(s):  
Critical Graphs

scholarly journals Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 544-553 ◽  
Author(s):  
Wei Gao ◽  
Yunqing Zhang ◽  
Yaojun Chen
Keyword(s):  
Data Transmission ◽  
Transmission Networks ◽  
Neighborhood Conditions ◽  
Transmission Rates ◽  
High Data ◽  
Critical Graph ◽  
Network Research ◽  
Neighborhood Condition ◽  
Fractional Factor ◽  
The Relationship

Abstract In data transmission networks, the availability of data transmission is equivalent to the existence of the fractional factor of the corresponding graph which is generated by the network. Research on the existence of fractional factors under specific network structures can help scientists design and construct networks with high data transmission rates. A graph G is named as an all fractional (g, f, n′, m)-critical deleted graph if the remaining subgraph keeps being an all fractional (g, f, m)-critical graph, despite experiencing the removal of arbitrary n′ vertices of G. In this paper, we study the relationship between neighborhood conditions and a graph to be all fractional (g, f, n′, m)-critical deleted. Two sufficient neighborhood conditions are determined, and furthermore we show that the conditions stated in the main results are sharp.

Sign in / Sign up

Export Citation Format

Share Document