Results 11 to 20 of about 226,666 (311)
Scale Free Interval Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoto Miyoshi +3 more
openaire +2 more sources
AbstractLet G be a graph on v labelled vertices with E edges, without loops or multiple edges. Let v → ∞ and let E=E(v) be a function of v such that lim E(v)v23=c. The limit of the probability that a random graph is a unit interval graph, indifference graph or proper interval graph is exp(−43c3).
Cohen, Joel E.
openaire +2 more sources
The order difference interval graph of a group [PDF]
In this paper we introduce the concept of order difference interval graph ¡ODI (G) of a group G. It is a graph ¡ODI (G) with V (¡ODI (G)) = G and two vertices a and b are adjacent in ¡ODI (G) if and only if o(b) − o(a) ∈ [o(a), o(b)].
P. Balakrishnan, R. Kala
doaj +1 more source
A characterization of the Total Graph of Interval Graphs and Proper Interval Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighbourhood of the third vertex. Let G be a graph with vertex set V (G) and edge set E(G), the total graph T(G) of G has vertex set V (G)∪E(G) and two vertices in T(G) are adjacent if and only if they are adjacent or incident in G.
Athul T B, G Suresh Singh
openaire +2 more sources
The power of interval models for computing graph centralities [PDF]
Food webs, some scheduling problems and DNA molecules all have in common a “linear structure” which can be captured through the idealized model of interval graphs (intersection graphs of intervals on a line).
Guillaume DUCOFFE
doaj +1 more source
Reconstruction of interval graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masashi Kiyomi +2 more
openaire +2 more sources
An Extension of Fuzzy Competition Graph and Its Uses in Manufacturing Industries
Competition graph is a graph which constitutes from a directed graph (digraph) with an edge between two vertices if they have some common preys in the digraph.
Tarasankar Pramanik +3 more
doaj +1 more source
On the enumeration of interval graphs [PDF]
We present upper and lower bounds for the number i n i_n
Yang, Joyce C., Pippenger, Nicholas
openaire +3 more sources
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
On the Cubicity of Interval Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandran, L Sunil +2 more
openaire +1 more source

