Abstract A classification scheme for Graph-Like Modeling Languages (GLML) is presented in this paper. The novelty of classifier lies its application to a meta-model GLML that deviates from the simple graph model and underlies large number GLML. main goal using support reuse layout algorithms are used directly or indirectly development software by model-based engineering techniques. In other dom...

We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. also provide examples oriented graphs that have non-Cohen-Macaulay vertex-weighted ideals, while the ideal their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes, Toledo.

Barrier coverage is a critical issue in wireless sensor networks for many practical applications, e.g., national border monitoring, security surveillance and intruder detection, etc. Its aim is to detect intruders that attempt to cross the protected region. Available works mainly focused on the barrier coverage of directional sensors (e.g., cameras), which have limited coverage area and sensing...

For a fixed graph H; let f ðn;HÞ denote the maximum possible number of edges not belonging to a monochromatic copy of H in a 2-edge-coloring of the complete graph of order n: Let exðn;HÞ be the Turán number of H; i.e., the maximum number of edges that a graph on n vertices can have without containing a copy of H: An easy lower bound of f ðn;HÞXexðn;HÞ follows from the 2-edge-coloring in which t...

This paper presents a graph-based formalism for an Ontology Based Access Control (OBAC) system applied to Digital Library (DL) ontology. It uses graph transformations, a graphical specification technique based on a generalization of classical string grammars to nonlinear structures. The proposed formalism provides an executable specification that exploits existing tools of graph grammar to veri...

A set S ⊆ V (G) is stable (or independent) if no two vertices from S are adjacent. Let Ψ(G) be the family of all local maximum stable sets [6] of graph G, i.e., S ∈ Ψ(G) if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. If I is stable and there is a matching from N(I) into I, then I is a crown of order |I|+ |N(I)|, and we write I ∈ Crown(G) [...

The focus of this chapter will be the uses of graph theory in chemoinformatics and in structural bioinformatics. There is a long history of chemical graph theory dating back to the 1860’s and Kekule’s structural theory. It is natural to regard the atoms of a molecule as nodes and the bonds as edges (2D representations) of a labeled graph (a molecular graph). This chapter will concentrate on the...

We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...

This paper introduces a scheduling problem with coupledtasks in presence of a compatibility graph on a single processor. We investigate a specific configuration, in which the coupled-tasks possess an idle time equal to 2. The complexity of these problems will be studied according to the presence or absence of triangles in the compatibility graph. As an extended matching, we propose a polynomial...