output
19982026
most citedGaia Data Release 2. Summary of the contents and survey properties

8.6k citations

Showing 2011Show all

14 papers · 1 filter

math.CO2011

Alliance free sets in Cartesian product graphs

Ismael G. Yero, Juan A. Rodriguez-Velazquez, Sergio Bermudo

Let be a graph. For a non-empty subset of vertices , and vertex , let denote the cardinality of the set of neighbors o…

cs.SE2011★ 18 cited

Saying Hello World with Epsilon - A Solution to the 2011 Instructive Case

Louis M. Rose, Antonio García-Domínguez, James R. Williams +3

Epsilon is an extensible platform of integrated and task-specific languages for model management. With solutions to the 2011 TTC Hello World case, this paper demonstrates some of t…

math.CO2011★ 23 cited

Roman domination in Cartesian product graphs and strong product graphs

Ismael G. Yero, Juan A. Rodriguez-Velazquez

A set of vertices of a graph is a dominating set for if every vertex outside of is adjacent to at least one vertex belonging to . The minimum cardinality of a do…

math.CO2011

Analogies between the geodetic number and the Steiner number of some classes of graphs

Ismael G. Yero, Juan A. Rodriguez-Velazquez

A set of vertices of a graph is a geodetic set of if every vertex lies on a shortest path between two vertices of . The minimum cardinality of a geodeti…

math.RA2011★ 5 cited

Simple Cuntz-Pimsner rings

Toke Meier Carlsen, Eduard Ortega, Enrique Pardo

Necessary and sufficient conditions for when every non-zero ideal in a relative Cuntz-Pimsner ring contains a non-zero graded ideal, when a relative Cuntz-Pimsner ring is simple, a…

math.CO2011★ 48 cited

On the partition dimension of trees

Juan A. Rodriguez-Velazquez, Ismael G. Yero, Magdalena Lemanska

Given an ordered partition of the vertex set of a connected graph , the \emph{partition representation} of a vertex with respect to t…