The connected forcing connected vertex detour number of a graph

2011 ◽  
Vol 31 (3) ◽  
pp. 461 ◽  
Author(s):  
A.P. Santhakumaran ◽  
P. Titus
Keyword(s):  
Connected Vertex

scholarly journals Extension and Its Price for the Connected Vertex Cover Problem

2019 ◽  
pp. 315-326
Author(s):  
Mehdi Khosravian Ghadikoalei ◽  
Nikolaos Melissinos ◽  
Jérôme Monnot ◽  
Aris Pagourtzis
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Connected Vertex Cover ◽  
Cover Problem ◽  
Connected Vertex

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

2007 ◽  
Vol 43 (2) ◽  
pp. 234-253 ◽  
Author(s):  
Daniel Mölle ◽  
Stefan Richter ◽  
Peter Rossmanith
Keyword(s):  
Vertex Cover ◽  
Tree Cover ◽  
Connected Vertex Cover ◽  
Connected Vertex

scholarly journals On finite G-locally primitive graphs and the Weiss conjecture

2004 ◽  
Vol 70 (3) ◽  
pp. 353-356 ◽  
Author(s):  
Mohammad A. Iranmanesh
Keyword(s):  
Permutation Group ◽  
Primitive Permutation Group ◽  
Vertex Transitive ◽  
Connected Vertex

A graph Γ is said to be a G-locally primitive graph, for G ≥ Aut Γ, if for every vertex, α, the stabiliser Gα induces a primitive permutation group on Γ (α) the set of vertices adjacent to α. In 1978 Richard Weiss conjectured that there exists a function f: ℕ →ℕ such that for any finite connected vertex-transitive G-locally primitive graph of valency d and a vertex α of the graph, |Gα| ≥ f(d). The purpose of this paper is to prove that, in the case Soc(G) = Sz(q), the conjecture is true.

scholarly journals A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs

2015 ◽  
Vol 571 ◽  
pp. 58-66 ◽  
Author(s):  
Limin Wang ◽  
Xiaoyan Zhang ◽  
Zhao Zhang ◽  
Hajo Broersma
Keyword(s):  
Unit Disk ◽  
Minimum Weight ◽  
Vertex Cover ◽  
Unit Disk Graphs ◽  
Connected Vertex Cover ◽  
Connected Vertex
Sign in / Sign up

Export Citation Format

Share Document