Results 21 to 30 of about 153,098 (217)
Interval-Valued Fuzzy Soft Graphs
Topological Algebra and its Applications, 2017 In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms, 2013 A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection.
Ryuhei Uehara
doaj +1 more source
Mathematics, 2019 The independent number of a graph G is the cardinality of the maximum independent set of G, denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G.
Mohammad Abudayah, Omar Alomari
doaj +1 more source
Blockchain Single and Interval Valued Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2019 Blockchain Technology (BCT) is a growing and reliable technology in various fields such as developing business deals, economic environments, social and politics as well. Without having a trusted central party this technology, gives the guarantee for safe
D. Nagarajan +3 more
doaj +1 more source
Interval edge-coloring: A model of curriculum scheduling
AKCE International Journal of Graphs and Combinatorics, 2020 Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the time for each teacher is consecutive.
Zehui Shao +4 more
doaj +1 more source
Foremost Walks and Paths in Interval Temporal Graphs
Algorithms, 2022 The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard.
Anuj Jain, Sartaj Sahni
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
Total Roman domination for proper interval graphs
Electronic Journal of Graph Theory and Applications, 2020 A function f:V → {0,1,2} is a total Roman dominating function (TRDF) on a graph G=(V,E) if for every vertex v ∈ V with f(v) = 0 there is a vertex u adjacent to v with f(u) = 2 and for every vertex v ∈ V with f(v) > 0 there exists a vertex u ∈ NG(v ...
Abolfazl Poureidi
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior +11 more
wiley +1 more source
Interval Incidence Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj +1 more source