Results 21 to 30 of about 94,998 (262)
On the Intersection Graphs Associeted to Posets
Discussiones Mathematicae - General Algebra and Applications, 2020 Let (P, ≤) be a poset with the least element 0. The intersection graph of ideals of P, denoted by G(P), is a graph whose vertices are all nontrivial ideals of P and two distinct vertices I and J are adjacent if and only if I ∩ J ≠ {0}.
Afkhami M. +2 more
doaj +1 more source
Arbitrarily Partitionable {2K2, C4}-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 +·…·+λp = n, there exists a partition (V1, V2, …, Vp) of the vertex set V such that Vi induces a connected ...
Liu Fengxia +2 more
doaj +1 more source
Computing the split domination number of grid graphs
Indonesian Journal of Combinatorics, 2021 A set D - V is a dominating set of G if every vertex in V - D is adjacent to some vertex in D. The dominating number γ(G) of G is the minimum cardinality of a dominating set D.
V. R. Girish, P. Usha
doaj +1 more source
Split Legendary Domination in graphs
Ratio MathematicaHarary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P.
Arman Boyacı +3 more
doaj +1 more source
Radio labeling of biconvex split graphs
AKCE International Journal of Graphs and CombinatoricsA radio labeling of a graph G is a function [Formula: see text] such that for every pair of distinct vertices [Formula: see text], where diam(G) denotes the diameter of the graph and d(u, v) is the distance between the vertices u and v.
G. Sethuraman, M. Nithya
doaj +1 more source
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid (ENPG).
Arman Boyacı +3 more
doaj +1 more source
RAD50 missense variants differentially affect the DNA damage response and mitotic progression
FEBS Letters, EarlyView.RAD50 incorporates into the MRN complex and initiates the DNA damage response. Furthermore, RAD50 promotes mitotic progression. RAD50 missense variants capable of forming an MRN complex supported the DNA damage response and mitotic features to different extents in complementation experiments, indicating these functions are separable and might impact ...
Hanna Redeker +9 more
wiley +1 more source
The monadic second-order logic of graphs XVI : Canonical graph decompositions [PDF]
Logical Methods in Computer Science, 2006 This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular ...
Bruno Courcelle
doaj +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source