Results 41 to 50 of about 3,018,719 (345)

Cliques and Clique Covers in Interval-Valued Fuzzy Graphs

open access: yesInternational Journal of Computational Intelligence Systems, 2021
Finding cliques and clique covers in graphs are one of the most needful tasks. In this paper, interval-valued fuzzy cliques (IVFQs) and interval-valued fuzzy clique covers (IVFQCs) of an interval-valued fuzzy graph (IVFG) are introduced by introducing ...
Napur Patra   +3 more
doaj   +1 more source

Interval Count of Interval Graphs

open access: yesCadernos 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

The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A graph $G$ is a cocomparability graph if there exists an acyclic transitive orientation of the edges of its complement graph $\overline{G}$. LBFS$^{+}$ is a variant of the generic Lexicographic Breadth First Search (LBFS), which uses a specific tie ...
Xiao-Lu Gao, Shou-Jun Xu
doaj   +1 more source

Interval Edge-Colorings of Cartesian Products of Graphs I

open access: yesDiscussiones 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

Minimum 2-Tuple Dominating Set of an Interval Graph

open access: yes, 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

Strong Interval – Valued Pythagorean Fuzzy Soft Graphs

open access: yesRatio 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

Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target

open access: yesFEBS Letters, EarlyView.
This study shows Plasmodium falciparum GEP1 is vital for activating sexual stages of malarial parasites even independently of a mosquito factor. Knockout parasites completely fail gamete formation even when a phosphodiesterase inhibitor is added. Two single‐nucleotide polymorphisms (V241L and S263P) are found in 12%–20% of field samples.
Frederik Huppertz   +5 more
wiley   +1 more source

A linear time algorithm to compute square of interval graphs and their colouring

open access: yesAKCE 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]

open access: yesTransactions 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

Open-interval graphs versus closed-interval graphs

open access: yesDiscrete Mathematics, 1987
It is proved that a countable graph is a closed-interval graph if and only if it is an open-interval graph. A counter-example is given for uncountable graphs. Also the case of unit length intervals is studied.
Frankl, P., Maehara, H.
openaire   +2 more sources

Home - About - Disclaimer - Privacy