Articles de revista
Recent Submissions
-
On the Laplacian spectra of token graphs
(Elsevier, 2021-09-15)
Article
Restricted access - publisher's policyWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent whenever ... -
New cyclic Kautz digraphs with optimal diameter
(2021)
Article
Open AccessWe obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree, there is no other digraph with a smaller diameter. This new family of digraphs are called `modified cyclic ... -
New production matrices for geometric graphs
(Elsevier, 2022-01-15)
Article
Restricted access - publisher's policyWe use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and ... -
On circles enclosing many points
(2021-10-01)
Article
Restricted access - publisher's policyWe prove that every set of n red and n blue points in the plane contains a red and a blue point such that every circle through them encloses at least points of the set. This is a two-colored version of a problem posed by ... -
Trees whose even-degree vertices induce a path are antimagic
(2020-05-01)
Article
Open AccessAn antimagic labeling of a connected 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 v is the sum of the labels ... -
Metric dimension of maximal outerplanar graphs
(2021-02-02)
Article
Open AccessIn 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 AccessA 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 AccessA 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
Open AccessAn 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 AccessMany 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 AccessA 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 ...
RSS 1.0