Extensibility of graphs

Other Title(s)

قابلية توسيع البيانات

Author

Attar, Akram Barzan

Source

Journal of Basrah Researches : Sciences

Issue

Vol. 37, Issue 4D (30 Sep. 2011), pp.35-42, 8 p.

Publisher

University of Basrah College of Education for Pure Sciences

Publication Date

2011-09-30

Country of Publication

Iraq

No. of Pages

8

Main Subjects

Information Technology and Computer Science

Topics

Abstract AR

في هذا البحث تم تقديم مفهوم البيانات و دراسة البيانات القابلة و غير القابلة للتوسيع.

كذلك تم تقديم مفهوم عدد توسيع للبيانات و إيجاد قيمته للبيانات المنتظمة و بيانات اويلر.

Abstract EN

In this paper, the concepts of extension of a graph (digraph) and the extensible class of graphs (digraphs) have been introduced.

The class of connected graphs as well as the class of Hamiltonian graphs which are extensible classes have also been proved.

The classes of regular, eulerian, bipartite and trees graphs which are not extensible classes have also been proved.

The concept of extensibility number has been introduced as well as the characterization of regular graphs (digraphs) which have extensibility number k.

Also the extensibility number of eulerian graphs (digraphs) has been characterized.

American Psychological Association (APA)

Attar, Akram Barzan. 2011. Extensibility of graphs. Journal of Basrah Researches : Sciences،Vol. 37, no. 4D, pp.35-42.
https://search.emarefa.net/detail/BIM-285870

Modern Language Association (MLA)

Attar, Akram Barzan. Extensibility of graphs. Journal of Basrah Researches : Sciences Vol. 37, no. 4D (Sep. 2011), pp.35-42.
https://search.emarefa.net/detail/BIM-285870

American Medical Association (AMA)

Attar, Akram Barzan. Extensibility of graphs. Journal of Basrah Researches : Sciences. 2011. Vol. 37, no. 4D, pp.35-42.
https://search.emarefa.net/detail/BIM-285870

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references : p. 41-42

Record ID

BIM-285870