L(0, 1)-Labelling of Trapezoid Graphs

2017 ◽  
Vol 3 (S1) ◽  
pp. 599-610 ◽  
Author(s):  
Satyabrata Paul ◽  
Madhumangal Pal ◽  
Anita Pal
Keyword(s):  
Trapezoid Graphs

MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS

2011 ◽  
Vol 03 (03) ◽  
pp. 323-336 ◽  
Author(s):  
FANICA GAVRIL
Keyword(s):  
Minimum Weight ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Circle Graphs ◽  
Intersection Model ◽  
The Family ◽  
Positive Weights ◽  
Vertex Set ◽  
Vertex Sets ◽  
Trapezoid Graphs

A circle n-gon is the region between n or fewer non-crossing chords of a circle, no chord connecting the arcs between two other chords; the sides of a circle n-gon are either chords or arcs of the circle. A circle n-gon graph is the intersection graph of a family of circle n-gons in a circle. The family of circle trapezoid graphs is exactly the family of circle 2-gon graphs and the family of circle graphs is exactly the family of circle 1-gon graphs. The family of circle n-gon graphs contains the polygon-circle graphs which have an intersection representation by circle polygons, each polygon with at most n chords. We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle n-gon graph with positive weights, when its intersection model by n-gon-interval-filaments is given.

scholarly journals Trapezoid graphs and their coloring

1988 ◽  
Vol 21 (1) ◽  
pp. 35-46 ◽  
Author(s):  
Ido Dagan ◽  
Martin Charles Golumbic ◽  
Ron Yair Pinter
Keyword(s):  
Trapezoid Graphs

scholarly journals Unrestricted and complete Breadth-First Search of trapezoid graphs in time

2010 ◽  
Vol 110 (12-13) ◽  
pp. 497-502 ◽  
Author(s):  
Christophe Crespelle ◽  
Philippe Gambette
Keyword(s):  
Breadth First Search ◽  
Trapezoid Graphs

scholarly journals An Algorithm for Hinge Vertex Problem on Circular Trapezoid Graphs

2017 ◽  
Vol 25 (0) ◽  
pp. 945-948 ◽  
Author(s):  
Hirotoshi Honma ◽  
Yoko Nakajima ◽  
Shigeru Masuyama
Keyword(s):  
Trapezoid Graphs

scholarly journals On powers of m-trapezoid graphs

1995 ◽  
Vol 63 (2) ◽  
pp. 187-192 ◽  
Author(s):  
Carsten Flotow
Keyword(s):  
Trapezoid Graphs

scholarly journals Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

2019 ◽  
Vol 07 (11) ◽  
pp. 2595-2602
Author(s):  
Hirotoshi Honma ◽  
Kento Nishimura ◽  
Yuto Tamori ◽  
Yoko Nakajima
Keyword(s):  
Vertex Connectivity ◽  
Trapezoid Graphs ◽  
Connectivity Problem

Computation of Inverse 1-Center Location Problem on the Weighted Trapezoid Graphs

2019 ◽  
Vol 31 (1) ◽  
pp. 14-35
Author(s):  
Biswanath Jana ◽  
Sukumar Mondal ◽  
Madhumangal Pal
Keyword(s):  
Location Problem ◽  
Center Location ◽  
Trapezoid Graphs
Sign in / Sign up

Export Citation Format

Share Document