|
Search the dblp DataBase
Angeles Carmona:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Camino Balbuena, Angeles Carmona
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:61, n:, pp:- [Journal]
- Enrique Bendito, Angeles Carmona, Andrés M. Encinas
Shortest Paths in Distance-regular Graphs. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2000, v:21, n:2, pp:153-166 [Journal]
- Enrique Bendito, Angeles Carmona, Andrés M. Encinas
Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2003, v:24, n:4, pp:365-375 [Journal]
- Angeles Carmona, Josep Fàbrega
On the superconnectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:3, pp:197-205 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
On the connectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:2, pp:97-105 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Superconnectivity of bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:61-75 [Journal]
- M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
On the order and size of s-geodetic digraphs with given connectivity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:174, n:1-3, pp:19-27 [Journal]
- M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Connectivity of large bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:174, n:1-3, pp:3-17 [Journal]
- Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
Extraconnectivity of graphs with large minimum degree and girth. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:85-100 [Journal]
Boundary value problems on weighted networks. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|