Results 181 to 189 of about 1,080,603 (189)
Some of the next articles are maybe not open access.
ACM Transactions on Algorithms, 2009
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ...
Yuli Ye, Allan Borodin
openaire +2 more sources
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ...
Yuli Ye, Allan Borodin
openaire +2 more sources
Computing with graphs and graph transformations
Software: Practice and Experience, 1999Many software applications require the construction and manipulation of graphs. In standard programming languages, this is accomplished using low-level mechanisms such as pointer manipulation or array indexing. In contrast, graph productions are a convenient high-level visual notation for coding graph modifications.
Dorothea Blostein, Andy Schürr
openaire +2 more sources
International Journal of Fuzzy Mathematical Archive
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire +1 more source
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire +1 more source
Graph equations for line graphs, total graphs and middle graphs
TRU Mathematics, 1976AKIYAMA, JIN +2 more
openaire +2 more sources
Permutation Graphs and Transitive Graphs
Journal of the ACM, 1972Shimon Even, Amir Pnueli, Abraham Lempel
openaire +3 more sources
Clique graphs of planar graphs.
Ars Comb., 2004The main result of this paper is a characterization of those \(K_3\)-free or \(K_4\)-free graphs which occur as the clique graphs of planar graphs. Several examples are given of planar graphs which do not occur as clique graphs of planar graphs.
Liliana Alcón, Marisa Gutierrez
openaire +2 more sources
Tolerance graphs and trapezoid graphs
J. Inf. Process. Cybern., 1991Tolerance graphs (e.g. see \textit{M. C. Golumbic}, \textit{C. L. Monma} and \textit{W. T. Trotter} jr. [Tolerance graphs. Discrete Appl. Math. 9, 157- 170 (1984; Zbl 0547.05054)]) and trapezoid graphs (e.g. see \textit{I. Dagan}, \textit{M. C. Golumbic} and \textit{R. Y. Pinter} [Trapezoid graphs and their coloring. Discrete Appl. Math. 21, No.
openaire +2 more sources