Results 1 to 10 of about 99 (66)
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
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 +2 more sources
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
Further generalization of symmetric multiplicity theory to the geometric case over a field
Special Matrices, 2021 Using the recent geometric Parter-Wiener, etc. theorem and related results, it is shown that much of the multiplicity theory developed for real symmetric matrices associated with paths and generalized stars remains valid for combinatorially symmetric ...
Cinzori Isaac +3 more
doaj +1 more source
The structure fault tolerance of burnt pancake networks
Open Mathematics, 2023 One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source
Star-Critical Ramsey Numbers for Cycles Versus K4
Discussiones Mathematicae Graph Theory, 2021 Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K there exists a red copy of G or a blue copy of H. The Ramsey number r(G, H) is defined as the smallest natural number n such that Kn → (G, H) and the star ...
Jayawardene Chula J. +2 more
doaj +1 more source