### Recent Submissions

• #### Metric dimension of maximal outerplanar graphs ﻿

(2021-02-02)
Article
Restricted access - publisher's policy
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2=ß(G)=¿2n5¿ and that the ...
• #### Elimination properties for minimal dominating sets of graphs ﻿

(2020-01-01)
Article
Open Access
A dominating set of a graph is a vertex subset such that every vertexnot in the subset is adjacent to at least one in the subset. In this paper westudy whenever there exists a new dominating set contained (respectively, ...
• #### Total domination in plane triangulations ﻿

(2021-01-01)
Article
Open Access
A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...
• #### Caterpillars are antimagic ﻿

(2021-01-21)
Article
Restricted access - publisher's policy
An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ...
• #### Reappraising the distribution of the number of edge crossings of graphs on a sphere ﻿

(Institute of Physics (IOP), 2020-08-01)
Article
Open Access
Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution ...
• #### Neighbor-locating colorings in graphs ﻿

(2020-02-02)
Article
Open Access
A k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ...