Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
Letter to Editor
Mini Review
Original Article
Research Article
Review Article
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
Letter to Editor
Mini Review
Original Article
Research Article
Review Article
View/Download PDF

Translate this page into:

Research Article
12 (
1
); 1-8

Some Degree Conditions on triple vertices for Digraph to be Supereulerian

Licence
This is an open-access article distributed under the terms of the Creative Commons Attribution-Non Commercial-Share Alike 4.0 License, which allows others to remix, transform, and build upon the work non-commercially, as long as the author is credited and the new creations are licensed under the identical terms.
Disclaimer:
This article was originally published by Qassim University and was migrated to Scientific Scholar after the change of Publisher.

Abstract

A digraph D is supereulerian if D has a spanning eulerian subdigraph. We prove that a strong digraph D of order n ≥ 4 satisfies the following conditions: for every triple x, y, z ∊ V(D) such that x and y are non-adjacent, if there is no arc from x to z, then d(x) + d(y) + d+(x) + d‾(z) ≥ 3n - 5. Then D is supereulerian.


Fulltext Views
191

PDF downloads
88
View/Download PDF
Download Citations
BibTeX
RIS
Show Sections