Results 21 to 30 of about 586,356 (320)
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj +1 more source
Interval Valued Intuitionistic Fuzzy Line Graphs
Objectives In the field of graph theory, an intuitionistic fuzzy set becomes a useful tool to handle problems related to uncertainty and impreciseness. We introduced the interval-valued intuitionistic fuzzy line graphs (IVIFLG) and explored the results ...
V. N. Srinivasa Rao Repalle +2 more
doaj +1 more source
FO Model Checking of Interval Graphs [PDF]
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that FO model checking and successor-invariant FO model checking can be solved
Robert Ganian +5 more
doaj +1 more source
Interval-valued bipolar fuzzy line graphs
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
A Characterization of Mixed Unit Interval Graphs [PDF]
We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs.
CG Lekkerkerker +9 more
core +1 more source
Coloring problem of signed interval graphs [PDF]
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
Simultaneous Representation of Proper and Unit Interval Graphs [PDF]
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where all objects ...
Rutter, Ignaz +3 more
core +2 more sources
Computing and counting longest paths on circular-arc graphs in polynomial time. [PDF]
The longest path problem asks for a path with the largest number of vertices in a given graph. The first polynomial time algorithm (with running time O(n4)) has been recently developed for interval graphs.
Cuntz +7 more
core +3 more sources
Counting interval graphs [PDF]
In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The enumeration makes use of a structural decomposition of interval graphs which leads to a characterization of those interval graphs having a unique interval
openaire +2 more sources
Certain Types of Interval-Valued Fuzzy Graphs
We propose certain types of interval-valued fuzzy graphs including balanced interval-valued fuzzy graphs, neighbourly irregular interval-valued fuzzy graphs, neighbourly total irregular interval-valued fuzzy graphs, highly irregular interval-valued fuzzy
Muhammad Akram +2 more
doaj +1 more source

