Ismael González Yero

Appl. Math. Comput., March, 2024

Complexity and Equivalency of Multiset Dimension and ID-colorings.

[BibT_eX]

[DOI]

Anni Hakanen

Fundam. Informaticae, 2024

Mutual-visibility problems on graphs of diameter two.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

On the total version of the covering Italian domination problem.

[BibT_eX]

[DOI]

M. Alfred Raju

P. Venkata Subba Reddy

Discret. Appl. Math., 2024

On the unicyclic graphs having vertices that belong to all their (strong) metric bases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Mutual-visibility in strong products of graphs via total mutual-visibility.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Variety of mutual-visibility problems in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Injective coloring of graphs revisited.

[BibT_eX]

[DOI]

Bostjan Bresar

Discret. Math., May, 2023

Global offensive k-alliances in digraphs.

[BibT_eX]

[DOI]

Bull. ICA, 2023

2022

On metric dimensions of hypercubes.

[BibT_eX]

[DOI]

Ars Math. Contemp., November, 2022

Incidence dimension and 2-packing number in graphs.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2022

Further results on packing related parameters in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

A note on the metric and edge metric dimensions of 2-connected graphs.

[BibT_eX]

[DOI]

Martin Knor

Riste Skrekovski

Discret. Appl. Math., 2022

On vertices contained in all or in no metric basis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Independent transversal total domination versus total domination in trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

A constructive characterization of vertex cover Roman trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

On three outer-independent domination related parameters in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Covering Italian domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On The (k, t)-Metric Dimension Of Graphs.

[BibT_eX]

[DOI]

Comput. J., 2021

A Steiner general position problem in graph theory.

[BibT_eX]

[DOI]

Comput. Appl. Math., 2021

General d-position sets.

[BibT_eX]

[DOI]

Sandi Klavzar

Douglas F. Rall

Ars Math. Contemp., 2021

Graphs with the edge metric dimension smaller than the metric dimension.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Global defensive k-alliances in directed graphs: combinatorial and computational issues.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2020

(Open) packing number of some graph products.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Constructive characterizations concerning weak Roman domination in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

On the computational complexities of three problems related to a privacy measure for large networks under active attack.

[BibT_eX]

[DOI]

Tanima Chatterjee

Bhaskar DasGupta

Nasim Mobasheri

Venkatkumar Srinivasan

Theor. Comput. Sci., 2019

Efficient closed domination in digraph products.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

On analyzing and evaluating privacy measures for social networks under active attack.

[BibT_eX]

[DOI]

Bhaskar DasGupta

Nasim Mobasheri

Inf. Sci., 2019

Error-correcting codes from k-resolving sets.

[BibT_eX]

[DOI]

Robert Bailey

Discuss. Math. Graph Theory, 2019

10th Andalusian Meeting on Discrete Mathematics.

[BibT_eX]

[DOI]

Juan Carlos Valenzuela Tripodoro

Discret. Appl. Math., 2019

Packing and domination parameters in digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Outer-independent total Roman domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On Computational and Combinatorial Properties of the Total Co-independent Domination Number of Graphs.

[BibT_eX]

[DOI]

Frank Angel Hernández Mira

Comput. J., 2019

Distance-based vertex identification in graphs: The outer multiset dimension.

[BibT_eX]

[DOI]

Reynaldo Gil Pons

Yunior Ramírez-Cruz

Rolando Trujillo-Rasua

Appl. Math. Comput., 2019

2018

Bounding the open k-monopoly number of strong product graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

Strong resolving graphs: The realization and the characterization problems.

[BibT_eX]

[DOI]

María Luz Puertas

Discret. Appl. Math., 2018

Uniquely identifying the edges of a graph: The edge metric dimension.

[BibT_eX]

[DOI]

Aleksander Kelenc

Niko Tratnik

Discret. Appl. Math., 2018

The fractional strong metric dimension in three graph products.

[BibT_eX]

[DOI]

Cong X. Kang

Eunjeong Yi

Discret. Appl. Math., 2018

2017

On some resolving partitions for the lexicographic product of two graphs.

[BibT_eX]

[DOI]

Nicolás Campanelli

Int. J. Comput. Math., 2017

Computing the metric dimension of a graph from primary subgraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

On the independence transversal total domination number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Graphs that are simultaneously efficient open domination and efficient closed domination graphs.

[BibT_eX]

[DOI]

Sandi Klavzar

Seyed Mahmoud Sheikholeslami

Discret. Appl. Math., 2017

On the strong Roman domination number of graphs.

[BibT_eX]

[DOI]

M. P. Álvarez-Ruiz

T. Mediavilla-Gradolph

Juan Carlos Valenzuela Tripodoro

Discret. Appl. Math., 2017

Computing the k-metric dimension of graphs.

[BibT_eX]

[DOI]

Hossein Abdollahzadeh Ahangar

Appl. Math. Comput., 2017

Mixed metric dimension of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity.

[BibT_eX]

[DOI]

M. Najimi

Vladimir Samodivkin

AKCE Int. J. Graphs Comb., 2017

2016

The security number of strong grid-like graphs.

[BibT_eX]

[DOI]

Marko Jakovac

Theor. Comput. Sci., 2016

k-Metric antidimension: A privacy measure for social graphs.

[BibT_eX]

[DOI]

Rolando Trujillo-Rasua

Inf. Sci., 2016

Strong metric dimension of rooted product graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Vertices, edges, distances and metric dimension in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Open k-monopolies in graphs: complexity and related concepts.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Closed formulae for the strong metric dimension of lexicographic product graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

The k-metric dimension of the lexicographic product of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Strong resolving partitions for strong product graphs and Cartesian product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack.

[BibT_eX]

[DOI]

Tanima Chatterjee

Bhaskar DasGupta

Nasim Mobasheri

Venkatkumar Srinivasan

CoRR, 2016

Characterizing 1-Metric Antidimensional Trees and Unicyclic Graphs.

[BibT_eX]

[DOI]

Rolando Trujillo-Rasua

Comput. J., 2016

The partition dimension of corona product graphs.

[BibT_eX]

Ars Comb., 2016

2015

On the Strong Metric Dimension of Cartesian Sum Graphs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Partial product of graphs and Vizing's conjecture.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

2014

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

On the strong metric dimension of product graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

k-metric resolvability in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2014

Efficient open domination in graph products.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

The partition dimension of strong product graphs and Cartesian product graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

On the strong metric dimension of Cartesian and direct products of graphs.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Discret. Math., 2014

On the partition dimension of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Bondage number of grid graphs.

[BibT_eX]

[DOI]

Magda Dettlaff

Discret. Appl. Math., 2014

On the Strong Partition Dimension of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

On Clark and Suen bound-type results for k-domination and Roman domination of Cartesian product graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

Alliance free sets in Cartesian product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Computing global offensive alliances in Cartesian product graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On the strong metric dimension of corona product graphs and join graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Boundary powerful k-alliances in graphs.

[BibT_eX]

Ars Comb., 2013

The double projection method for some domination related parameters in Cartesian product graphs.

[BibT_eX]

Amaurys Rondón Aguilar

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Nordhaus-Gaddum results for the convex domination number of a graph.

[BibT_eX]

[DOI]

Period. Math. Hung., 2012

Partitioning a Graph into Global Powerful k-Alliances.

[BibT_eX]

[DOI]

Graphs Comb., 2012

2011

Partitioning a graph into offensive k-alliances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

On the metric dimension of corona product graphs.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2011

2010

Contribution to the study of alliances in graphs.

[BibT_eX]

[DOI]

PhD thesis, 2010

Boundary defensive k-alliances in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On geodetic and k-geodetic sets in graphs.

[BibT_eX]

Ars Comb., 2010

On global offensive k-alliances in graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2010

A note on the partition dimension of Cartesian product graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2010

On the Partition Dimension of Cartesian Product Graphs.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Defensive k-alliances in graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

On the Decomposition of Graphs into Offensive k-Alliances.

[BibT_eX]

[DOI]