scholarly journals Grup Automorfisma Graf Tangga dan Graf Lingkaran

Author(s):  
Muhammad Abdy ◽  
Wahidah Sanusi ◽  
A. Armansyah

Abstrak. Automorfisma dari suatu graf G merupakan isomorfisma dari graf G ke dirinya sendiri, yaitu fungsi yang memetakan dirinya sendiri. Automorfisma suatu graf dapat dicari dengan menentukan semua kemungkinan fungsi yang satu-satu, onto serta isomorfisma dari himpunan titik pada graf tersebut. Artikel  ini difokuskan pada penentuan banyaknya fungsi pada graf tangga dan graf lingkaran yang automorfisma serta grup yang dibentuk oleh himpunan automorfisma dari kedua graf tersebut. Jenis penelitian ini merupakan penelitian dasar atau penelitian murni dan metode yang digunakan adalah studi literatur. Hasil penelitian ini menunjukkan bahwa graf tangga  membentuk grup abelian berorde-2, graf tangga membentuk grup dihedral berorde-8, dan graf tangga    membentuk grup abelian berorde-4. Sedangkan graf lingkaran  membentuk grup dihedral berorde-2n.Kata Kunci: Automorfisma, Graf Lingkaran, Graf Tangga, GrupAbstract. An automorphism of a graph G is an isomorphism of graph G to itself i.e. the function that maps onto itself. An automorphism of a graph can be looked for by determining all possible  functions which is one-to-one, onto, and isomorphism from vertex set at the graph. This article is focused on determining the number of automorphism functions on ladder graph and cycle graph and the groups formed by the two  graphs. The tipe of this research is basic research or pure research and the research method used is literarture review. The result show that ladder graph  forms an abelian group of order 2, ladder graph  forms a dihedral group of order 8, and ladder graph  forms an abelian group of order 4. In other side, cycle graph ,  forms a dihedral group of order 2n.Keywords: Automorphism, Cycle Graph, Ladder Graph, Group

2017 ◽  
Vol 3 (1) ◽  
pp. 1-4
Author(s):  
Abdussakir Abdussakir

Commuting graph C(G) of a non-Abelian group G is a graph that contains all elements of G as its vertex set and two distinct vertices in C(G) will be adjacent if they are commute in G. In this paper we discuss commuting graph of dihedral group D2n. We show radius, diameter, cycle multiplicity, and metric dimension of this commuting graph in several theorems with their proof.


2018 ◽  
Vol 1 (1) ◽  
pp. 29-40
Author(s):  
Novita Novita ◽  
Damar Aji Irawan ◽  
Benyamin Suwitorahardjo

The biggest challenge faced by students nowadays and in the future, is how to deal with the increasingly high competition in the world, the increasing number of undergraduate and limited job opportunities. In this kind of situations, the students had to find a creative way and change the approach of being a university graduate looking for a job, to become scholars who can create their own jobs, or even able to create jobs for others. The purpose of this study was to determine the youth interest on entrepreneurship in Indonesia. It seems that the youth are unaware to see that the job is increasingly difficult to find nowadays. So through this study, researchers wanted to find out what causes youth in Indonesia, reluctant to become an entrepreneur. While being an entrepreneur, the youth can open or create jobs for others and can reduce the level of unemployment in Indonesia. Self-confidence is an important factor in entrepreneurship. Family environment and quality education also participate in creating interest for youth in entrepreneurship. This research is using basic research method; where researchers will try to link the theories of the existing variables. Thus, researchers can conduct research by distributing questionnaires to the youth throughout Indonesia. This study aims to determine the cause of Indonesian youth lack of interest in entrepreneurship.


1973 ◽  
Vol 15 (4) ◽  
pp. 428-429 ◽  
Author(s):  
G. J. Hauptfleisch

If A, B, H, K are abelian group and φ: A → H and ψ: B → K are epimorphisms, then a given central group extension G of H by K is not necessarily a homomorphic image of a group extension of A by B. Take for instance A = Z(2), B = Z ⊕ Z, H = Z(2), K = V4 (Klein's fourgroup). Then the dihedral group D8 is a central extension of H by K but it is not a homomorphic image of Z ⊕ Z ⊕ Z(2), the only group extension of A by the free group B.


2018 ◽  
Vol 36 (3) ◽  
pp. 129-139
Author(s):  
Behnaz Tolue

In this paper we introduce stable subgroup graph associated to the group $G$. It is a graph with vertex set all subgroups of $G$ and two distinct subgroups $H_1$ and $H_2$ are adjacent if $St_{G}(H_1)\cap H_2\neq 1$ or $St_{G}(H_2)\cap H_1\neq 1$. Its planarity is discussed whenever $G$ is an abelian group, $p$-group, nilpotent, supersoluble or soluble group. Finally, the induced subgraph of stable subgroup graph with vertex set whole non-normal subgroups is considered and its planarity is verified for some certain groups.


2019 ◽  
Vol 12 (05) ◽  
pp. 1950081
Author(s):  
M. Jahandideh ◽  
R. Modabernia ◽  
S. Shokrolahi

Let [Formula: see text] be a non-abelian finite group and [Formula: see text] be the center of [Formula: see text]. The non-commuting graph, [Formula: see text], associated to [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if and only if [Formula: see text]. We conjecture that if [Formula: see text] is an almost simple group and [Formula: see text] is a non-abelian finite group such that [Formula: see text], then [Formula: see text]. Among other results, we prove that if [Formula: see text] is a certain almost simple group and [Formula: see text] is a non-abelian group with isomorphic non-commuting graphs, then [Formula: see text].


2019 ◽  
Vol 2 (1) ◽  
pp. 26
Author(s):  
Fenti Margareta ◽  
Budianto Budianto ◽  
Sutoyo Sutoyo

ABSTRACT   This research is aimed to find out the most appropriate propagation method of Siamese Pontianak orange plant vegetatively. This research was done on 31st January 2019 until 31st March 2019 in experimentan garden of Punten, Sidomulyo village, Batu City. The method used in propagation of Siamese Pontianak orange planf vegetatively are insert grafting, side grafting, and top grafting. The research method used is Randomized Block Design (RAK) with non factorial experiment method that consist of 3 level that are insert grafting, side grafting, and top grafting that was repeated 9 times, so that obtained 27 experiment units. Data analysis used is ANNOVA and if there is real difference then it will be further tested using BNT. Parameters that are observed are: growing time of shoots, length of shoots, and the number of leaves. The research result show that insert grafting is an appropriate method in propagation of Siamese Pontianak orange plant with better result growing time of shoots, length of shoots, and number of leaves.   Keywords: Vegetatif Propagation Method, Siamese Pontianak Orange   ABSTRAK   Penelitian bertujuan untuk mengetahui metode perbanyakan tanaman jeruk Siam Pontianak yang tepat dilaksanakan pada 31 Januari 2019 sampai dengan 31 Maret 2019 di Kebun Percobaan Punten Desa Sidomulyo Kota Batu. Metode yang digunakan dalam perbanyakan tanaman jeruk Siam Pontianak Secara vegetatif yaitu okulasi sisip, sambung samping, dan sambung pucuk. Penelitian ini menggunakan Rancangan Acak Kelompok dengan metode percobaan non faktorial yang terdiri dari 3 taraf yaitu okulasi sisip, sambung samping, dan sambung pucuk yang diulang sebanyak 9 kali, sehingga diperoleh sebanyak 27 unit percobaan. Hasil penelitian menunjukkan bahwa okulasi sisip merupakan metode yang tepat dalam perbanyakan tanaman jeruk Siam Pontianak dengan hasil waktu tumbuh tunas, panjang tunas, dan jumlah daun yang lebih baik.   Kata kunci: Metode Perbanyakan Vegetatif, Jeruk Siam Pontianak


10.37236/353 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Walter Klotz ◽  
Torsten Sander

Let $\Gamma$ be a finite, additive group, $S \subseteq \Gamma, 0\notin S, -S=\{-s: s\in S\}=S$. The undirected Cayley graph Cay$(\Gamma,S)$ has vertex set $\Gamma$ and edge set $\{\{a,b\}: a,b\in \Gamma$, $a-b \in S\}$. A graph is called integral, if all of its eigenvalues are integers. For an abelian group $\Gamma$ we show that Cay$(\Gamma,S)$ is integral, if $S$ belongs to the Boolean algebra $B(\Gamma)$ generated by the subgroups of $\Gamma$. The converse is proven for cyclic groups. A finite group $\Gamma$ is called Cayley integral, if every undirected Cayley graph over $\Gamma$ is integral. We determine all abelian Cayley integral groups.


2016 ◽  
Vol 5 (2) ◽  
pp. 132
Author(s):  
Essam El Seidy ◽  
Salah Eldin Hussein ◽  
Atef Mohamed

We consider a finite undirected and connected simple graph  with vertex set  and edge set .We calculated the general formulas of the spectra of a cycle graph and path graph. In this discussion we are interested in the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, and seidel adjacency matrix.


1992 ◽  
Vol 20 (3) ◽  
pp. 208-209 ◽  
Author(s):  
Ruth E. Shaffer

Shaffer responds to Ganaway's critique of the Shaffer and Cozolino (1992) qualitative investigation of reports of ritualistic abuse. Describing systematically, accurately, and factually the similarities and differences in victims’ experiences with respect to ritualistic abuse has its place as a basic research method. Until more scientific approaches are applicable, investigating claims of ritualistic abuse seems a much more responsible scientific response than simply ignoring or denying them. A more sophisticated methodology may ultimately build on the foundation provided by descriptive research. A drawback of the more scientific model is its reductionism; the better way may be to increase understanding of human behavior through enlarging understanding of victims’ phenomenological experience.


Science ◽  
1955 ◽  
Vol 122 (3168) ◽  
pp. 518-518
Author(s):  
W. PIGMAN
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document