This document provides insight to the similarities and differences of Graph Transformation and AI Planning, two rising research fields with different publication organs and tools. While graph transformation systems can be used as a graphical knowledge engineering front-end for designing planning problems, AI planning technology (especially heuristic search) can accelerate the exploration proces...

This report describes the Fifth Annual Graph Drawing Contest , held in conjunction with the 1998 Graph Drawing Symposium in Montreal, Canada. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology 4, 5, 6, 7].

RDF [1] Graph modeling is a foundational technology in the whole semantic web (SW) technology stack. Since its debut in 2004, RDF graph has enjoyed many applications in the enterprise domain. Examples of these applications include, but certainly not limited to, integration and federated query of heterogeneous data sources, flexible and extensible representation of enterprise knowledge base, adh...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

In stock market, foreign currency exchange market, or any other asset trading system, there are high-density data, which is a typical data streams. And the trading rules are often the functions of many variables. The visualization of these systems is very important for users to do analysis and trading. So the problem is how to show the graph of the large data and multiple-variable functions. Th...

This report describes the Fourth Annual Graph Drawing Contest, held in conjunction with the 1997 Graph Drawing Symposium in Rome, Italy. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology [2, 3, 4]. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without ...

Path properties, such as ’geodesic’, ’induced’, ’all paths’ define a convexity on a connected graph. The general notion of path property, introduced in this paper, gives rise to a comprehensive survey of results obtained by different authors for a variety of path properties, together with a number of new results. We pay special attention to convexities defined by path properties on graph produc...

Mathematical logic is the logical basis of the modern computer. It is important for the development of the electronic computer. With the development of computer technology, especially the development of computer visualization technology, the two-dimensional objects, such as graph and table, are more and more frequently as the computer processing object. But, the traditional one-dimensional char...

The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph is Ω(n), and the circumference of a 3-connected claw-free graph is Ω(n). We generalise and improve the first result by showing that every 3-edge-connected graph with m edges has an Eulerian subgraph with Ω(m) edges. We ...