We present an approach to attributed graph transformation which requires neither infinite graphs containing data algebras nor auxiliary edges that link graph items with their attributes. Instead, we use the double-pushout approach with relabelling and extend it with rule schemata which are instantiated to ordinary rules prior to application. This framework provides the formal basis for the grap...

‘Double edge swaps’ transform one graph into another while preserving the graph’s degree sequence, and have thus been used in a number of popular Markov chain Monte Carlo (MCMC) sampling techniques. However, while double edge-swaps can transform, for any fixed degree sequence, any two graphs inside the classes of simple graphs, multigraphs, and pseudographs, this is not true for graphs which al...

Jaeger’s directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show that hexagon graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig’s augmentations.

Abstract In this paper, we present a sufficient condition for the exponential stability of class linear switched systems. As an application result, establish output-based adaptive distributed observer general leader system over periodic jointly connected switching communication network, which extends applicability from marginally stable to any and undirected graph directed graph. This will be a...

In a graph, vertex dominates itself and its neighbors. A subset S of vertices graph G is double dominating set if every at least twice. The domination number γ ×2 ( ) the minimum cardinality . this paper, we prove that maximal outerplanar order n bounded above by + k /2, where pairs consecutive degree two with distance 3 on outer cycle. We also ×2( ≤ 5 /8 for Hamiltonian planar ≥ 7.

Let H be a 3-uniform hypergraph of order n and size m, and let T be a subset of vertices of H. The set T is a strong transversal in H if T contains at least two vertices from every edge of H. The strong transversal number τs(H) of H is the minimum size of a strong transversal in H. We show that 7τs(H) ≤ 4n+ 2m, and we characterize the hypergraphs that achieve equality in this bound. In particul...

I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...

In this paper, we focus on one type of labeling is called range labeling, have introduced for certain graphs as Pz, Cz, Sy,z(Double star), sun graph and some trees.

Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kept additionally to traditional precedence relations (A can directly precede B if no activity must be allocated between A and B). Such precedence relations are motivated by solving problems like modelling sequence-depend...