Name
Abstract | ||
|---|---|---|
Given a class G of graphs, G graphs are defined as follows. A G is probe G if thereexists a partition of its vertices into a set of probevertices and a stable set of nonprobe vertices in such away that non-edges of G , whose endpoints are nonprobevertices, can be added so that the resulting graph belongs to G . We investigate probe 2-clique graphs andprobe diamond-free graphs. For probe 2-clique graphs, we present apolynomial-time recognition algorithm. Probe diamond-free graphs arecharacterized by minimal forbidden induced subgraphs. As a by-product,it is proved that the class of probe block graphs is the intersectionbetween the classes of chordal graphs and probe diamond-free graphs. |
Year | Venue | Field |
|---|---|---|
2015 | Discrete Mathematics & Theoretical Computer Science | Discrete mathematics,Indifference graph,Combinatorics,Chordal graph,Clique-sum,Cograph,Pathwidth,Metric dimension,Mathematics,Trapezoid graph,Split graph |
DocType | Volume | Issue |
Journal | 17 | 1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Flavia Bonomo | 1 | 226 | 28.95 |
| Celina M. H. de Figueiredo | 2 | 296 | 38.49 |
| Guillermo Alfredo Durán | 3 | 0 | 0.34 |
| Luciano Norberto Grippo | 4 | 0 | 0.34 |
| Martín Darío Safe | 5 | 23 | 8.99 |
| Jayme Luiz Szwarcfiter | 6 | 618 | 95.79 |