Labeled Embedding Of (n, n-2)-Graphs In Their Complements

Open access

Abstract

Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E. Duchêne and H. Kheddouci, Labeled 2-packings of trees, Discrete Math. 338 (2015) 816-824] and cycles [E. Duchˆene, H. Kheddouci, R.J. Nowakowski and M.A. Tahraoui, Labeled packing of graphs, Australas. J. Combin. 57 (2013) 109-126]. In this note, we present a lower bound on the labeled packing number of any (n, n − 2)-graph into Kn. This result improves the bound given by Woźniak in [Embedding graphs of small size, Discrete Appl. Math. 51 (1994) 233-241].

[1] B. Bollobás and S.E. Eldridge, Packing of graphs and applications to computational complexity, J. Combin. Theory Ser. B 25 (1978) 105-124. doi:

[2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (McMillan, London; Elsevier, New York, 1976).

[3] D. Burns and S. Schuster, Every (p, p − 2) graph is contained in its complement , J. Graph Theory 1 (1977) 277-279. doi:

[4] E. Duchêne, H. Kheddouci, R.J. Nowakowski and M.A. Tahraoui, Labeled packing of graphs, Australas. J. Combin. 57 (2013) 109-126.

[5] N. Sauer and J. Spencer, Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978) 295-302. doi:

[6] M.A. Tahraoui, E. Duchêne and H. Kheddouci, Labeled 2-packings of trees, Discrete Math. 338 (2015) 816-824. doi:

[7] M. Woźniak, Embedding graphs of small size, Discrete Appl. Math. 51 (1994) 233-241. doi:

[8] M. Woźniak, Packing of graphs and permutations-a survey, Discrete Math. 276 (2004) 379-391. doi:

[9] H.P. Yap, Packing of graphs-a survey, Discrete Math. 72 (1988) 395-404. doi:

Discussiones Mathematicae Graph Theory

The Journal of University of Zielona Góra

Journal Information


IMPACT FACTOR 2018: 0.741
5-year IMPACT FACTOR: 0.611



CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2017: 0.36

Target Group

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 137 99 20
PDF Downloads 55 43 7