Results 11 to 20 of about 1,119 (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 +3 more sources
Generalization of (Q,L)-Fuzzy Soft Subhemirings of a Hemiring
Advances in Fuzzy Systems, 2022 This paper investigates the properties and results of (Q,L)-fuzzy soft subhemirings ((Q,L)-FSSHR) of a hemiring R. The motivation behind this study is to utilize the concept of L-fuzzy soft set of a hemiring and to derive a few specific outcomes on (Q, L)
K. Geetha +5 more
doaj +3 more sources
α-Completely Regular and Almost α-Completely Regular Spaces
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 This work is aimed at studying some of the characterizations of α-completely regular and almost α-completely regular spaces through the new concept of α-zero sets and α-continuous functions.
A. Azzam, A. Nasef
semanticscholar +2 more sources
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +2 more sources
Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture [PDF]
Ars Math. Contemp., 2021 Label the vertices of the complete graph Kv with the integers {0, 1, . . . , v − 1} and define the length of the edge between x and y to be min(|x−y|, v−|x−y|). Let L be a multiset of size v − 1 with underlying set contained in {1, . . . , bv/2c}.
M. A. Ollis +3 more
semanticscholar +1 more source
Decomposing 10-Regular Graphs into Paths of Length 5
Discussiones Mathematicae Graph Theory, 2022 Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2021 Let H be a digraph (possibly with loops) and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). For an arc (x, y) of D, its color is denoted by c(x, y). A directed path W = (v0, . .
Campero-Alonzo José Manuel +1 more
doaj +1 more source
Remarks on path-factor critical avoidable graphs
International Journal of Cognitive Computing in Engineering, 2023 Zhou (2023) introduced the concept of path-factor critical avoidable graph and determined several parameter bounds for (P≥2,n) or (P≥3,n)-factor critical avoidable graphs.
Zhengyue He +3 more
doaj +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
Discussiones Mathematicae Graph Theory, 2023 A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source