Results 41 to 50 of about 3,522,534 (301)
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 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
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
On interval representations of graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga de Queiroz, Aquiles +2 more
openaire +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 +2 more sources
Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs
CoRR, 2022 In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and interval bigraphs.
Ashok Kumar Das, Indrajit Paul
openaire +2 more sources
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
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
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
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