p-Index From 2021 - 2026
3.981
P-Index
This Author published in this journals
All Journal IPTEK The Journal for Technology and Science Jurnal S2 Pendidikan Matematika AKSIOMA: Jurnal Program Studi Pendidikan Matematika AlphaMath: Journal of Mathematics Education Proceeding SENDI_U Union: Jurnal Ilmiah Pendidikan Matematika Jurnal Matematika: MANTIK Journal of Mathematics and Mathematics Education (JMME) Jurnal Pembelajaran Matematika JTAM (Jurnal Teori dan Aplikasi Matematika) JCES (Journal of Character Education Society) DoubleClick : Journal of Computer and Information Technology Buana Matematika : Jurnal Ilmiah Matematika dan Pendidikan Matematika Jurnal Informatika Global Jurnal Studi Guru dan Pembelajaran Jurnal Manajemen Informatika dan Sistem Informasi Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Jurnal Abdi Insani Infotek : Jurnal Informatika dan Teknologi Jurnal Sains dan Edukasi Sains Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Nusantara Science and Technology Proceedings Infotech: Jurnal Informatika & Teknologi INTELEKTIVA Jurnal Pengabdian kepada Masyarakat Jurnal Pengabdian Kepada Masyarakat Decode: Jurnal Pendidikan Teknologi Informasi KOMMAS: Jurnal Pengabdian Kepada Masyarakat Duta.com : Jurnal Ilmiah Teknologi Informasi dan Komunikasi Khatulistiwa: Jurnal Pendidikan dan Sosial Humaniora Jurnal Indonesia Sosial Teknologi Proceeding of International Conference Health, Science And Technology (ICOHETECH) Politeknosain Nusantara Journal of Computers and its Applications SmartComp Jurnal Pendidikan dan Sosial Humaniora
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : IPTEK The Journal for Technology and Science

Eccentric Digraph of Cocktail Party Graph and Hypercube Tri Atmojo Kusmayadi; Nugroho Arif Sudibyo
IPTEK The Journal for Technology and Science Vol 22, No 4 (2011)
Publisher : IPTEK, LPPM, Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j20882033.v22i4.74

Abstract

Let G be a graph with a set of vertices V(G) and a set of edges E(G). The distance from vertex u to vertex v in G, denoted by d(u, v), is the length of the shortest path from vertex u to v. The eccentricity of vertex u in graph G is the maximum distance from vertex u to any other vertices in G, denoted by e(u). Vertex v is an eccentric vertex from u if d(u, v) = e(u). The eccentric digraph ED(G) of a graph G is a graph that has the same set of vertices as G, and there is an arc (directed edge) joining vertex u to v if v is an eccentric vertex from u. In this paper, we determine the eccentric digraph of a class of graph called the cocktail party graph and hypercube.