Results 31 to 40 of about 9,811 (181)
Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product [PDF]
Transactions on Combinatorics, 2020 Metric dimension and defensive $k$-alliance number are two distance-based graph invariants which have applications in robot navigation, quantitative analysis of secondary RNA structures, national defense and fault-tolerant computing.
Kinkar Chandra Das, Mostafa Tavakoli
doaj +1 more source
Connectivity and other invariants of generalized products of graphs [PDF]
, 2015 Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let G be a family of digraphs such that V (F) = V for every F¿G. Consider any function h:E(D)¿G.
López Masip, Susana Clara +1 more
core +3 more sources
Super connectivity of lexicographic product graphs
, 2020 For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph without isolated vertices.
Kamyab, Khalid +2 more
openaire +2 more sources
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 An L(2, 1)-coloring (or labeling) of a graph G is a mapping [Formula: see text] such that [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text] The span of an L(2, 1)-coloring is the maximum color assigned by it.
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
Intuitionistic Fuzzy Graphs with Categorical Properties
Fuzzy Information and Engineering, 2015 The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou +3 more
doaj +1 more source
Lexicographic product graphs P m [ P n ] are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct.
Wenhui Ma +3 more
doaj +2 more sources
On the weak Roman domination number of lexicographic product graphs
, 2018 A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
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
Utilizing lexicographic max product of picture fuzzy graph in human trafficking
Ain Shams Engineering JournalGraph structures are an essential tool for solving combinatorial problems in computer science and computational intelligence. With an emphasis on signed graphs, picture-fuzzy graphs, and graphs with colored or labeled edges, this study explores the ...
Peide Liu +4 more
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