default search action
Ignacio M. Pelayo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j39]Liliana Alcón, Marisa Gutierrez, Carmen Hernando
, Mercè Mora
The neighbor-locating-chromatic number of trees and unicyclic graphs. Discuss. Math. Graph Theory 43(3): 659-675 (2023) - 2021
- [j38]Najibeh Shahbaznejad
Some product graphs with power dominating number at most 2. AKCE Int. J. Graphs Comb. 18(3): 127-131 (2021) - [i2]Nicolas Bousquet, Quentin Deschamps, Aline Parreau, Ignacio M. Pelayo:
Metric dimension on sparse graphs and its applications to zero forcing sets. CoRR abs/2111.07845 (2021) - 2020
- [j37]Liliana Alcón
Neighbor-locating colorings in graphs. Theor. Comput. Sci. 806: 144-155 (2020)
2010 – 2019
- 2019
- [j36]Carmen Hernando
Locating domination in bipartite graphs and their complements. Discret. Appl. Math. 263: 195-203 (2019) - [j35]Carmen Hernando
Resolving dominating partitions in graphs. Discret. Appl. Math. 266: 237-251 (2019) - 2018
- [j34]José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
General bounds on limited broadcast domination. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j33]Carmen Hernando
Neighbor-locating coloring: graph operations and extremal cardinalities. Electron. Notes Discret. Math. 68: 131-136 (2018) - 2015
- [j32]Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
On global location-domination in graphs. Ars Math. Contemp. 8(2): 365-379 (2015) - [j31]José Cáceres, María Luz Puertas
Quasiperfect Domination in Trees. Electron. Notes Discret. Math. 50: 439-444 (2015) - 2014
- [j30]Carmen Hernando
Nordhaus-Gaddum bounds for locating domination. Eur. J. Comb. 36: 1-6 (2014) - [j29]José Cáceres, María Luz Puertas
The graph distance game and some graph operations. Electron. Notes Discret. Math. 46: 153-159 (2014) - [j28]Carmen Hernando
LD-graphs and global location-domination in bipartite graphs. Electron. Notes Discret. Math. 46: 225-232 (2014) - 2013
- [j27]José Cáceres, Carmen Hernando
Locating-dominating codes: Bounds and extremal cardinalities. Appl. Math. Comput. 220: 38-45 (2013) - [j26]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Some structural, metric and convex properties of the boundary of a graph. Ars Comb. 109: 267-283 (2013) - 2012
- [j25]José Cáceres, M. Carmen Hernando
On the metric dimension of infinite graphs. Discret. Appl. Math. 160(18): 2618-2626 (2012) - [i1]José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
Locating dominating codes: Bounds and extremal cardinalities. CoRR abs/1205.2177 (2012) - 2010
- [j24]José Cáceres, M. Carmen Hernando
On the geodetic and the hull numbers in strong product graphs. Comput. Math. Appl. 60(11): 3020-3031 (2010) - [j23]M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood:
Extremal Graph Theory for Metric Dimension and Diameter. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j22]José Cáceres, M. Carmen Hernando
On the Metric Dimension of Infinite Graphs. Electron. Notes Discret. Math. 35: 15-20 (2009) - 2008
- [j21]José Cáceres, M. Carmen Hernando
Geodeticity of the contour of chordal graphs. Discret. Appl. Math. 156(7): 1132-1142 (2008) - 2007
- [j20]Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
On the connectivity of cages with girth five, six and eight. Discret. Math. 307(11-12): 1441-1446 (2007) - [j19]M. Carmen Hernando
Extremal Graph Theory for Metric Dimension and Diameter. Electron. Notes Discret. Math. 29: 339-343 (2007) - [j18]José Cáceres, M. Carmen Hernando
On the Metric Dimension of Cartesian Products of Graphs. SIAM J. Discret. Math. 21(2): 423-441 (2007) - 2006
- [j17]José Cáceres, M. Carmen Hernando
On geodetic sets formed by boundary vertices. Discret. Math. 306(2): 188-198 (2006) - [j16]M. Carmen Hernando
Some structural, metric and convex properties on the boundary of a graph. Electron. Notes Discret. Math. 24: 203-209 (2006) - 2005
- [j15]M. Carmen Hernando
On the Steiner, geodetic and hull numbers of graphs. Discret. Math. 293(1-3): 139-154 (2005) - [j14]Xavier Marcote, Camino Balbuena
(delta, g)-cages with g geq 10 are 4-connected. Discret. Math. 301(1): 124-136 (2005) - [j13]José Cáceres, María Luz Puertas, M. Carmen Hernando
Searching for geodetic boundary vertex sets. Electron. Notes Discret. Math. 19: 25-31 (2005) - [j12]M. Carmen Hernando
On the metric dimension of some families of graphs. Electron. Notes Discret. Math. 22: 129-133 (2005) - 2004
- [j11]Ignacio M. Pelayo
Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41-54]. Discret. Math. 280(1-3): 259-263 (2004) - [j10]Xavier Marcote, Camino Balbuena
Diameter, short paths and superconnectivity in digraphs. Discret. Math. 288(1-3): 113-123 (2004) - 2003
- [j9]José Gómez, Ignacio M. Pelayo
Diameter vulnerability of GC graphs. Discret. Appl. Math. 130(3): 395-416 (2003) - [j8]Xavier Marcote, Ignacio M. Pelayo
Every cubic cage is quasi 4-connected. Discret. Math. 266(1-3): 311-320 (2003) - [j7]Ignacio M. Pelayo
Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discret. Math. 267(1-3): 229-246 (2003) - [j6]Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo:
Algebraic properties of a digraph and its line digraph. J. Interconnect. Networks 4(4): 377-393 (2003) - 2002
- [j5]Camino Balbuena, Ignacio M. Pelayo, José Gómez:
On the superconnectivity of generalized p-cycles. Discret. Math. 255(1-3): 13-23 (2002) - [j4]Camino Balbuena, Josep Fàbrega
Superconnected digraphs and graphs with small conditional diameters. Networks 39(3): 153-160 (2002) - 2001
- [j3]Ignacio M. Pelayo, Camino Balbuena, José Gómez:
On the connectivity of generalized p-cycles. Ars Comb. 58 (2001) - [j2]Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena:
Every Cubic Cage is quasi 4-connected. Electron. Notes Discret. Math. 10: 216-219 (2001) - 2000
- [b1]Ignacio Manuel Pelayo Melero:
Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks. Polytechnic University of Catalonia, Spain, 2000
1990 – 1999
- 1999
- [j1]José Gómez, Ignacio M. Pelayo, Camino Balbuena:
New large graphs with given degree and diameter six. Networks 34(2): 154-161 (1999)
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-06-10 21:26 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: