Results 21 to 30 of about 588,772 (275)
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
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
Strong Interval – Valued Pythagorean Fuzzy Soft Graphs
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
Quantum ergodicity for graphs related to interval maps [PDF]
We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)).
A. Bouzouina +40 more
core +2 more sources
- and -labeling problems on interval graphs
For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of ...
Sk Amanathulla, Madhumangal Pal
doaj +1 more source
OBDD-Based Representation of Interval Graphs [PDF]
A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$ can lead to a (
B. Bollig +22 more
core +1 more source
Extremal Values of the Interval Number of a Graph [PDF]
The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vertex in $G$ there can be assigned a collection of at most $t$ finite closed intervals on the real line so that there is an edge between vertices $v$ and $w$
B. West, Douglas, Jerrold R. Griggs
core +1 more source
We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
Interval-Valued Fuzzy Soft Graphs
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
Bounded Representations of Interval and Proper Interval Graphs
Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex
D.G. Corneil +11 more
core +1 more source

