On eulerian subgraphs of complementary graphs
نویسندگان
چکیده
منابع مشابه
Eulerian subgraphs and Hamilton-connected line graphs
Let C(l, k) denote a class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G − S has order at least n− k l . We prove the following. (1) If G ∈ C(6, 0), then G is supereulerian if and only if G cannot be contracted to K2,3, K2,5 or K2,3(e), where e ∈ E(K2,3) and K2,3(e) stands for a graph obtained fro...
متن کاملOn Sylow Subgraphs of Vertex-transitive Self-complementary Graphs
One of the basic facts of group theory is that each finite group contains a Sylow p-subgroup for each prime p which divides the order of the group. In this note we show that each vertex-transitive selfcomplementary graph has an analogous property. As a consequence of this fact, we obtain that each prime divisor p of the order of a vertex-transitive self-complementary graph satisfies the congrue...
متن کاملSpanning eulerian subgraphs in N -locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملSpanning eulerian subgraphs in N2-locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connectedN2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملNetwork synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network’s corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1979
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1979.101606