Sciweavers

8 search results - page 1 / 2
» Superconnected digraphs and graphs with small conditional di...
Sort
View
NETWORKS
2002
13 years 10 months ago
Superconnected digraphs and graphs with small conditional diameters
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
Camino Balbuena, Josep Fàbrega, Xavier Marc...
DM
2002
95views more  DM 2002»
13 years 10 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
DM
2007
136views more  DM 2007»
13 years 10 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
AUTOMATICA
2007
92views more  AUTOMATICA 2007»
13 years 11 months ago
Observability analysis for structured bilinear systems: A graph-theoretic approach
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
T. Boukhobza, Frédéric Hamelin
WG
2010
Springer
13 years 9 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski