Hypergraph systems and their extensions
D. Janssens, G. Rozenberg (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
D. Janssens, G. Rozenberg (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of...
A. Rudnicki (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Izak Broere, Peter Mihók (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Farrell, E.J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
S.F. Forouhandeh, N. Jafari Rad, B.H. Vaqari Motlagh, H.P. Patil, R. Pandiya Raj (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...
Barbara Strug, Anna Paszyńska, Maciej Paszyński, Ewa Grabska (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values...