On Self-Complementary Cyclic Packing of Forests
Copyright policy )On Self-Complementary Cyclic Packing of Forests
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order $4p$ and size less than $3p$ is a subgraph of a self-complementary graph of order $4p$ with a cyclic self-complementary permutation. We also discuss some generalization of the main result.
forest, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), self-complemetary graphs, cyclic self-complementary permutation, Trees
forest, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), self-complemetary graphs, cyclic self-complementary permutation, Trees
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!