Abstract

For a graph $$G$$G, let $$\delta _F(G)=\min \{\max \{d(u), d(v)\} | \text{ for } \text{ any }~u, v\in V(G)\, \text{ with } \text{ distance }~2\}$$?F(G)=min{max{d(u),d(v)}|foranyu,v?V(G)withdistance2}. A graph is supereulerian if it has a spanning Eulerian subgraph. Let $$p>0$$p>0, $$g>2$$g>2 and $$\epsilon $$∈ be given nonnegative numbers. Let $$\mathcal{Q}$$Q be the family of non-supereulerian graphs with order at most $$5(p-2)$$5(p-2). In this paper, we prove that for a 3-edge-connected graph $$G$$G of order $$n$$n, if $$G$$G satisfies a Fan-type condition $$\delta _F(G)\ge \frac{n}{(g-2)p}-\epsilon $$?F(G)?n(g-2)p-∈ and $$n$$n is sufficiently large, then $$G$$G is supereulerian if and only if $$G$$G is not contractible to a graph in $$\mathcal{Q}$$Q. Results on best possible values of $$p$$p and $$\epsilon $$∈ for such graphs to either be supereulerian or be contractible to the Petersen graph are given.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.