Results 51 to 60 of about 3,546,741 (346)
Interval-valued bipolar fuzzy line graphs
BMC Research Notes, 2023 Objectives The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models.
Keneni Abera Tola +2 more
doaj +1 more source
Interval graphs and interval orders
Discrete Mathematics, 1985 This paper investigates the connection between interval graphs and interval orders, with special attention to the family of interval orders that agree with or provide representations of an interval graph. Relationships between interval graphs and interval orders that concern the number of lengths required for interval representations and bounds on ...
openaire +1 more source
Polynomial kernels for Proper Interval Completion and related problems
, 2011 Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V \times V)\E such that the graph H = (V,E \cup F) is a proper interval graph.
Bessy, Stéphane, Perez, Anthony
core +5 more sources
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
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
International 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
Simultaneous Interval Graphs [PDF]
, 2010 In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I (and the corresponding induced edges), are said to be ...
Krishnam Raju Jampani, Anna Lubiw
openaire +3 more sources
Betweenness in graphs: A short survey on shortest and induced path betweenness
AKCE International Journal of Graphs and Combinatorics, 2019 Betweenness is a universal notion present in several disciplines of mathematics. The notion of betweenness has a profound history and many pioneers like Euclid, Pasch, Hilbert have studied betweenness axiomatically.
Manoj Changat +2 more
doaj +2 more sources
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs [PDF]
Discrete 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
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