Results 51 to 60 of about 26,105 (190)
Outer Independent Double Italian Domination of Some Graph Products
Theory and Applications of Graphs, 2023 An outer independent double Italian dominating function on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ for which each vertex $x\in V(G)$ with $\color{red}{f(x)\in \{0,1\}}$ then $\sum_{y\in N[x]}f(y)\geqslant 3$ and vertices assigned $0 ...
Rouhollah Jalaei, Doost Ali Mojdeh
doaj +1 more source
The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs
, 2015 Let ${\mathcal G}$ be a graph family defined on a common (labeled) vertex set $V$. A set $S\subseteq V$ is said to be a simultaneous metric generator for ${\cal G}$ if for every $G\in {\cal G}$ and every pair of different vertices $u,v\in V$ there exists
Estrada-Moreno, Alejandro +2 more
core +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Dominating sequences in grid-like and toroidal graphs [PDF]
, 2016 A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$
Brešar, Boštjan +7 more
core +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
International Transactions in Operational Research, EarlyView.Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
Lexicographic Effect Algebras [PDF]
, 2014 In the paper we investigate a class of effect algebras which can be represented in the form of the lexicographic product $\Gamma(H\lex G,(u,0))$, where $(H,u)$ is an Abelian unital po-group and $G$ is an Abelian directed po-group.
Dvurečenskij, Anatolij
core
Gromov hyperbolicity in lexicographic product graphs [PDF]
Proceedings - Mathematical Sciences, 2018 arXiv admin note: text overlap with arXiv:1410 ...
Walter Carballosa +2 more
openaire +3 more sources
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
International Transactions in Operational Research, EarlyView.Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete +3 more
wiley +1 more source