Results 1 to 10 of about 101 (95)
Reinforcement Number of a Graph with respect to Half-Domination
Journal of Mathematics, 2021 In this paper, we introduce the concept of reinforcement number with respect to half-domination and initiate a study on this parameter. Furthermore, we obtain various upper bounds for this parameter. AMS subject classification: 05C38, 05C40, 05C69.
G. Muhiuddin +4 more
doaj +2 more sources
Under Which Conditions Is λ″(G)=κ″(L(G))?
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Mohsen Ghasemi
exaly +3 more sources
A canonical tree-of-tangles theorem for structurally submodular separation systems [PDF]
, 2021 We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.Mathematics Subject Classifications: 05C40, 05C83 ...
Elbracht, Christian +4 more
core +1 more source
On the Essential Element Graph of a Lattice [PDF]
, 2022 ▪ 2010 AMS Classification: 13A70, 05C40, 06A07.Let mathcalL be a bounded lattice. The essential element graph of mathcalL is a simple undirected graph varepsilonmathcalL such that the elements x,y of mathcalL form an edge in varepsilonmathcalL, whenever ...
ÜLKER, ALPER, Alper ÜLKER
core +1 more source
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
Conflict-Free Vertex Connection Number At Most 3 and Size of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in a vertex-coloured graph is called conflict-free if there is a colour used on exactly one of its vertices. A vertex-coloured graph is said to be conflict-free vertex-connected if any two distinct vertices of the graph are connected by a conflict-
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source
On the connectivity of the disjointness graph of segments of point sets in general position in the plane [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if and only ...
J. Leaños +2 more
doaj +1 more source
Friends and strangers walking on graphs [PDF]
, 2021 Given graphs \(X\) and \(Y\) with vertex sets \(V(X)\) and \(V(Y)\) of the same cardinality, we define a graph \(\mathsf{FS}(X,Y)\) whose vertex set consists of all bijections \(\sigma\colon V(X)\to V(Y)\), where two bijections \(\sigma\) and \(\sigma'\)
Kravitz, Noah +4 more
core +1 more source
The Strong 3-Rainbow Index of Graphs Containing Three Cycles [PDF]
, 2023 The concept of a strong k-rainbow index is a generalization of a strong rainbow connection number, which has an interesting application in security systems in a communication network.
Zata Yumni Awanis
core +1 more source
Discussiones Mathematicae Graph Theory, 2022 A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G − S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (
Erker Tjaša Paj, Špacapan Simon
doaj +1 more source