Results 41 to 50 of about 259 (109)

Traffic and Emergency Network Optimisation Using Domination in Picture Fuzzy Directed Graphs

Journal of Mathematics, Volume 2026, Issue 1, 2026.
In this paper, the picture fuzzy digraphs PFDGs are analysed in depth concerning their domination number (DN) and connectedness, offering new insights into structural properties and decision‐making approaches for handling uncertainty. Picture fuzzy sets (PFS) are a generalisation of traditional intuitionistic fuzzy sets, which provide a mathematical ...
J. Shivangi Mishra, A. Meenakshi, Antonios Kalampakas, Leo Mršić, Tofigh Allahviranloo, Sovan Samanta, Smritijit Sen   +6 more
wiley   +1 more source

The intersection density of cubic arc-transitive graphs with \(2\)-arc-regular full automorphism group equal to \( \operatorname{PGL}_{2}(q)\) [PDF]

The intersection density of a transitive permutation group \(G\leq \operatorname{Sym}(V)\) is the ratio between the largest size of a subset of \(G\) in which any two agree on at least one element of \(V\), and the order of a point-stabilizer of \(G ...
Meagher, Karen, Razafimahatratra, Andriaherimanana Sarobidy   +1 more
core   +1 more source

Bipartite graphs with close domination and k-domination numbers

Open Mathematics, 2020
Let kk be a positive integer and let GG be a graph with vertex set V(G)V(G). A subset D⊆V(G)D\subseteq V(G) is a kk-dominating set if every vertex outside DD is adjacent to at least kk vertices in DD. The kk-domination number γk(G){\gamma }_{k}(G) is the
Ekinci Gülnaz Boruzanlı, Bujtás Csilla   +1 more
doaj   +1 more source

Dominant Metric Dimension of Unit Graphs of Finite Commutative Rings

Journal of Mathematics, Volume 2026, Issue 1, 2026.
Let R be a finite commutative ring with identity and let U(R) denote its unit group. The unit graph GU(R) is the simple graph on the vertex set R in which distinct vertices x, y are adjacent if and only if x + y ∈ U(R). A dominating resolving set is a vertex set that dominates the graph and resolves all vertices via distance representations; the ...
Eman S. Almotairi, Smritijit Sen
wiley   +1 more source

Selection of an Optimal Warehouses Using Global Regular Domination in Graphs

International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
Let G = (V, E) be a simple graph. A subset S of V (G) is said to be global dominating set if S is a dominating set of the given graph G and its complement G. A subset whose induced subgraph is regular in G is also regular in G. A dominating set D of V (G) is called a regular dominating set if hSi is regular. In this article, we introduce global regular
R. Sundareswaran, M. Shanmugapriya, Ammar Alsinai, N. Venkataraman, V. Swaminathan, Hanan Ahmed, Anwar Saleh Alwardi   +6 more
wiley   +1 more source

Dominance, dependence and interdependence in linear structures. A theoretical model and an application to the international trade flows

, 2013
Classification AMS : 05 - Combinatorics for finite fields/05C - Graphs theory for applications of graphs/05C25 - Graphs and groups 05 - Combinatorics for finite fields/05C - Graphs theory for applications of graphs/05C69 - Dominating sets, independent ...
Lantner, Roland, Lebert, Didier
core   +3 more sources

Improving the Efficiency of Fuzzy Graphs and Their Complements Using Some Influencing Parameters

Journal of Mathematics, Volume 2025, Issue 1, 2025.
This study focuses on constructing optimal network structures for fuzzy graph (FG) products. In graph theory, the complement of a FG product is essential since it analyses alternate interactions between the vertices. Such a complement is used to represent situations in which specific connections are deliberately excluded, which helps to understand ...
A. Meenakshi, J. Shivangi Mishra, Hong Qin, Muniyandy Elangovan, Tareq Al-Shami   +4 more
wiley   +1 more source

A Study on Variants of Status Unequal Coloring in Graphs and Its Properties

Journal of Mathematics, Volume 2024, Issue 1, 2024.
Let G∧ be a simple connected graph with vertex set ϑG∧ and edge set ξG∧. The status of a vertex p∈ϑG∧ is defined as ∑q≠pd(p, q). A subset P of ϑG∧ is called a status unequal dominating set (stu‐dominating set) of G∧; for every q∈ϑ−P, there exists p in P such that p and q are adjacent and st(p) ≠ st(q).
Parvathy Gnana Sambandam, Sundareswaran Raman, Sakander Hayat, Swaminathan Venkatasubramanian, Xiaogang Liu   +4 more
wiley   +1 more source

Perfect Roman {3}‐Domination in Graphs: Complexity and Bound of Perfect Roman {3}‐Domination Number of Trees

Journal of Mathematics, Volume 2024, Issue 1, 2024.
A perfect Roman {3}‐dominating function on a graph G = (V, E) is a function f : V⟶{0, 1, 2, 3} having the property that if f(v) = 0, then ∑u∈N(v)f(u) = 3, and if f(v) = 1, then ∑u∈N(v)f(u) = 2 for any vertex v ∈ V. The weight of a perfect Roman {3}‐dominating function f is the sum ∑v∈Vf(v).
Ahlam Almulhim, Santi Spadaro
wiley   +1 more source

A Constructive Characterization of Vertex Cover Roman Trees

Discussiones Mathematicae Graph Theory, 2021
A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera, Kuziak Dorota, Yero Ismael G.   +2 more
doaj   +1 more source