On the Generalized Complement of Some Graphs (original) (raw)
Related papers
Characterization of Generalized Complements of a Graph
Advances in Mathematics: Scientific Journal, 2020
} be a partition of vertex set V (G) of order k ≥ 2. For all V i and V j in P , i = j, remove the edges between V i and V j in graph G and add the edges between V i and V j which are not in G. The graph G P k thus obtained is called the k−complement of graph G with respect to the partition P. For each set V r in P , remove the edges of graph G inside V r and add the edges of G (the complement of G) joining the vertices of V r. The graph G P k(i) thus obtained is called the k(i)−complement of graph G with respect to the partition P. In this paper, we characterize few properties of generalized complements of a graph.
The induced path number of the complements of some graphs
The induced path number ρ(G) of a graph G is defined as the minimum number of subsets into which the vertex set V(G) of G can be partitioned such that each subset induces a path. This paper investigates the induced path number of the complement of the Cartesian product of two complete graphs K m and K n , the complement of the path P n , n≥4, the cycle C n-1 , n≥4, the graph C m ×C n , m≥n≥3, and the graph C 3 ×P m , for m≥4. The following beautiful result of Nordhaus and Gaddum type for the induced path number of a graph and its complement is proved as well. Theorem: For any graph G of order n we have n≤ρ(G)+ρ(G ¯)≤3n 2· Moreover both bounds are tight.
Partitioning graphs into complete and empty graphs
Discrete Mathematics, 2009
Given integers j and k and a graph G, we consider partitions of the vertex set of G into j + k parts where j of these parts induce empty graphs and the remaining k induce cliques. If such a partition exists, we say G is a (j, k)-graph. For a fixed j and k we consider the maximum order n where every graph of order n is a (j, k)-graph. The split-chromatic number of G is the minimum j where G is a (j, j)-graph. Further, the cochromatic number is the minimum j+k where G is a (j, k)-graph. We examine some relations between cochromatic, split-chromatic and chromatic numbers. We also consider some computational questions related to chordal graphs and cographs.
A Study on the Edge-Set Graphs of Certain Graphs
Let G(V,E)G(V, E)G(V,E) be a simple connected graph, with ∣E∣=epsilon.|E| = \epsilon.∣E∣=epsilon. In this paper, we define an edge-set graph mathcalGG\mathcal G_GmathcalGG constructed from the graph GGG such that any vertex vs,iv_{s,i}vs,i of mathcalGG\mathcal G_GmathcalGG corresponds to the iii-th sss-element subset of E(G)E(G)E(G) and any two vertices vs,i,vk,mv_{s,i}, v_{k,m}vs,i,vk,m of mathcalGG\mathcal G_GmathcalGG are adjacent if and only if there is at least one edge in the edge-subset corresponding to vs,iv_{s,i}vs,i which is adjacent to at least one edge in the edge-subset corresponding to vk,mv_{k,m}vk,m where s,ks,ks,k are positive integers. It can be noted that the edge-set graph mathcalGG\mathcal G_GmathcalGG of a graph GGG id dependent on both the structure of GGG as well as the number of edges epsilon.\epsilon.epsilon. We also discuss the characteristics and properties of the edge-set graphs corresponding to certain standard graphs.
Partitioning a graph into two pieces, each isomorphic to the other or to its complement
Discrete Mathematics, 2005
A simple graph G has the generalized-neighbour-closed-co-neighbour property, or is a gncc graph, if for all vertices x of G, the subgraph, induced by the set of neighbours of x, is isomorphic to the subgraph, induced by the set of non-neighbours of x, or is isomorphic to its complement. If every vertex x satisfies the first condition (that is, the subgraphs, induced by its set of neighbours, and by its set of non-neighbours, are isomorphic), then the graph has the neighbour-closed-co-neighbour property, or is an ncc graph. In [A. Bonato, R. Nowakowski, Partitioning a graph into two isomorphic pieces, J. Graph Theory, 44 (2003) 1-14], the ncc graphs were characterized and a polynomial time algorithm was given for their recognition. In this paper we show that all gncc graphs are also ncc, that is, we prove that the two families of graphs, defined above, are identical. Finally, we present some of the properties of an interesting family of graphs, that is derived from the proof of the claim above, and we give a polynomial time algorithm to recognize such graphs.
Dual point-partition number of complementary graphs
1990
Dual point-partition number of a graph G with respect to a hereditary property P is the maximum number of disjoint point-induced subgraphs contained in G such that any subgraph does not have the property P. In this article, problems of the Nordhaus-Gaddum type for the dual point-partition number are investigated.
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovasz, Catlin, Kostochka and Rabern.
Edge-Complement Graphs – Another Approach
Asian Research Journal of Mathematics
The collection of edge complement spanning subgraphs of a simple graph is an abelian group with respect to the symmetric difference operation.
On the activities and partitions of the vertex subsets of graphs
Enumerative Combinatorics and Applications
Crapo introduced a construction of interval partitions of Boolean lattice for sets equipped with matroid structure. This construction, in the context of graphic matroids, is related to the notion of edge activities introduced by Tutte. This implies that each spanning subgraph of a connected graph can be constructed from edges of exactly one spanning tree by deleting a unique subset of internally active edges and adding a unique subset of externally active edges. The family of vertex independent sets does not give rise to a matroid structure. Therefore, we cannot apply Crapo's construction on the vertex set when using the family of independent sets as generating sets. In this paper, we introduce the concept of vertex activities to tackle the problem of generating interval partitions of the Boolean lattice of the vertex set. We show how to generate a cover, present some properties related to vertex activities of some special maximal independent sets and consider some special graphs. Finally, we will show that level labellings in pruned graphs always generate a partition.