Edge-connectivity and edge-superconnectivity in sequence graphs

Authors:
C. Balbuena;J. Fíbrega;P. García-Vázquez
Affiliations:
Departament de Matemítica Aplicada III, Universitat Politècnica de Catalunya, Campus Nord, Edifici C2, C/ Jordi Girona 1 i 3, E-08034 Barcelona, Spain;Departament de Matemítica Aplicada IV, Universitat Politècnica de Catalunya, Campus Nord, Edifici C3, C/ Jordi Girona 1 i 3, E-08034 Barcelona, Spain;Departamento de Matemática Aplicada I, Universidad de Sevilla, Avda Reina Mercedes 2, E-41012 Sevilla, Spain
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 6
Cited 0

Graphs on alphabets as models for large interconnection networks

Discrete Applied Mathematics - Special double volume: interconnection networks
Super edge-connectivity of dense digraphs and graphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Connectivity of iterated line graphs

Discrete Applied Mathematics
Edge-connectivity and super edge-connectivity of P2-path graphs

Discrete Mathematics
A sufficient condition for Pk-path graphs being r-connected

Discrete Applied Mathematics
Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers

Quantified Score

Hi-index	0.04

Visualization

Abstract

The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1...n] for subsequent queries of the form: "Given indices i, j, what is the index of the minimum value of A[i...j]?" ...