default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁngeles Carmona
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Aida Abiad, Ángeles Carmona, Andrés M. Encinas, María José Jiménez
:
The M-matrix group inverse problem for distance-biregular graphs. Comput. Appl. Math. 42(4) (2023)
2010 – 2019
- 2019
- [j26]C. Araúz, Ángeles Carmona, Andrés M. Encinas, Margarida Mitjana:
Green functions on product networks. Discret. Appl. Math. 263: 22-34 (2019) - 2016
- [j25]Ángeles Carmona, Margarida Mitjana, Eduard Monso:
The group inverse of subdivision networks. Electron. Notes Discret. Math. 54: 295-300 (2016) - 2015
- [j24]Ángeles Carmona, Andrés M. Encinas, Silvia Gago, María José Jiménez, Margarida Mitjana:
The inverses of some circulant matrices. Appl. Math. Comput. 270: 785-793 (2015) - 2014
- [j23]C. Araúz, Ángeles Carmona, Andrés M. Encinas:
Recovering the conductances on grids. Electron. Notes Discret. Math. 46: 11-18 (2014) - [j22]C. Araúz, Ángeles Carmona, Andrés M. Encinas:
Dirichlet-to-Robin Matrix on networks. Electron. Notes Discret. Math. 46: 65-72 (2014) - [j21]Ángeles Carmona, Andrés M. Encinas, Margarida Mitjana:
Potential Theory on Finite Networks. Electron. Notes Discret. Math. 46: 113-120 (2014) - [j20]Ángeles Carmona, Andrés M. Encinas, Silvia Gago, Margarida Mitjana:
Laplacian matrix of a weighted graph with new pendant vertices. Electron. Notes Discret. Math. 46: 129-136 (2014) - [j19]Ángeles Carmona, Andrés M. Encinas, Margarida Mitjana:
The Kirchhoff index of unicycle weighted chains. Electron. Notes Discret. Math. 46: 217-224 (2014) - 2012
- [j18]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas:
The Kirchhoff indices of join networks. Discret. Appl. Math. 160(1-2): 24-37 (2012) - 2011
- [j17]C. Araúz, Enrique Bendito, Ángeles Carmona, Andrés M. Encinas:
The Kirchhoff Index of Cluster Networks. Electron. Notes Discret. Math. 38: 57-62 (2011) - [j16]Ángeles Carmona, Enrique Bendito, Andrés M. Encinas, Margarida Mitjana:
On the Moore-Penrose inverse of distance-regular graphs. Electron. Notes Discret. Math. 38: 227-232 (2011)
2000 – 2009
- 2009
- [j15]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas, José Manuel Gesto, Andrés Gómez, José Carlos Mouriño, María Teresa Sánchez Rúa:
Computational cost of the Fekete problem I: The Forces Method on the 2-sphere. J. Comput. Phys. 228(9): 3288-3306 (2009) - 2008
- [j14]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas:
Boundary value problems on weighted networks. Discret. Appl. Math. 156(18): 3443-3463 (2008) - 2007
- [j13]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas, José Manuel Gesto:
Regular two-point boundary value problems for the Schrödinger operator on a path. Electron. Notes Discret. Math. 28: 199-206 (2007) - [j12]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas, José Manuel Gesto:
Estimation of Fekete points. J. Comput. Phys. 225(2): 2354-2376 (2007) - 2003
- [j11]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas:
Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures. Eur. J. Comb. 24(4): 365-375 (2003) - 2001
- [j10]Camino Balbuena, Ángeles Carmona:
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. Ars Comb. 61 (2001) - [j9]Ángeles Carmona, Enrique Bendito, Andrés M. Encinas:
Equilibrium Measures on Finite Networks: Effective Resistance and Hitting Time. Electron. Notes Discret. Math. 10: 68-71 (2001) - 2000
- [j8]Enrique Bendito, Ángeles Carmona, Andrés M. Encinas:
Shortest Paths in Distance-regular Graphs. Eur. J. Comb. 21(2): 153-166 (2000)
1990 – 1999
- 1999
- [j7]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Superconnectivity of bipartite digraphs and graphs. Discret. Math. 197-198: 61-75 (1999) - [j6]Ángeles Carmona, Josep Fàbrega:
On the superconnectivity and the conditional diameter of graphs and digraphs. Networks 34(3): 197-205 (1999) - 1997
- [j5]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth. Discret. Math. 167-168: 85-100 (1997) - [j4]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
Connectivity of large bipartite digraphs and graphs. Discret. Math. 174(1-3): 3-17 (1997) - [j3]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the order and size of s-geodetic digraphs with given connectivity. Discret. Math. 174(1-3): 19-27 (1997) - 1996
- [j2]M. C. Balbuena, Ángeles Carmona, Miguel Angel Fiol:
Distance connectivity in graphs and digraphs. J. Graph Theory 22(4): 281-292 (1996) - [j1]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs. Networks 28(2): 97-105 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
