LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Languages: Indonesian
Types: Unknown
Subjects: Eksponen Vertex, Digraph Dwi-Warna, Dua Loop

Classified by OpenAIRE into

arxiv: Astrophysics::Cosmology and Extragalactic Astrophysics, Computer Science::Discrete Mathematics, Astrophysics::Galaxy Astrophysics
A digraph D in which each of its arcs is coloured by either red or blue is called two-coloured digraph. A strongly connected of two-coloured digraph is primitive provided there are nonnegative integers m and b such that for each pair of vertices u and v in D there is a walk with length m + b, in which m arcs coloured by red and b arcs coloured by blue. Let D is a two-coloured digraph with V (D) = {v1, v2, · · · , vn} for each vk 2 V (D), the vertex exponent of D is the smallest nonnegative integer m + b such that there is a walk with length m + b from vk to each vertex in D. Let D is a two-coloured digraph on n vertex with n 3 and 2 loops, if vk, k = 1, 2, ..., n is vertex of D, this paper will give the general of vertex exponent of D exactly 2n−2 for k = 1, 2, 3 and exactly 2n−5+k for 4 k n. Universitas Sumatera 060803032
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article