Results 51 to 60 of about 3,671,469 (355)
Minimum 2-Tuple Dominating Set of an Interval Graph
, 2011 The -tuple domination problem, for a fixed positive integer , is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least vertices in this set.
Tarasankar Pramanik +2 more
semanticscholar +1 more source
Interval Count of Interval Graphs
Cadernos do IME - Série Informática, 2022 The interval count problem is that of determining the smallest number of distinct interval lengths that is sufficient to represent an interval model of a given interval graph. The class of interval graphs is well known, with several applications. This article briefly summarizes my doctorate thesis done on the subject with supervision of Prof.
openaire +1 more source
Interval Edge-Colorings of Cartesian Products of Graphs I
Discussiones Mathematicae Graph Theory, 2013 A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers.
Petrosyan Petros A. +2 more
doaj +1 more source
Strong Interval – Valued Pythagorean Fuzzy Soft Graphs
Ratio Mathematica, 2023 A Strong interval – valued Pythagorean fuzzy soft sets (SIVPFSS) an extending the theory of Interval-valued Pythagorean fuzzy soft set (IVPFSS). Then we Propose Strong interval valued Pythagorean fuzzy soft graphs (SIVPFSGs).
Mohammed Jabarulla Mohamed +1 more
doaj +1 more source
A linear time algorithm to compute square of interval graphs and their colouring
AKCE International Journal of Graphs and Combinatorics, 2016 The square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such that two vertices x and y are adjacent in G2 if and only if there is a path of length one or two between x and y in G.
Satyabrata Paul +2 more
doaj +1 more source
Coloring problem of signed interval graphs [PDF]
Transactions on Combinatorics, 2019 A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
doaj +1 more source
On some Graphs with a Unique Perfect Matching
, 2017 We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free ...
Chaplick, S. +3 more
core +1 more source
Interval- valued fermatean neutrosophic graphs
Decision Making: Applications in Management and Engineering, 2022 n ...
Broumi, Said +6 more
openaire +2 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source