scholarly journals Application of Quotient Graph Theory to Three-Edge Star Graphs

2021 ◽  
Vol 140 (6) ◽  
pp. 514-524
Author(s):  
V. Ježe ◽  
J. Lipovský
2021 ◽  
Vol 14 (2) ◽  
pp. 62
Author(s):  
Arif Budi Prasetyo ◽  
Yoga Jati Kusuma

Graph theory contains several topics, one of which will be discussed in this study is graph labeling. In the topic of labeling, the graph used is a limited, simple, and undirected graph. In this study, the type of labeling used is total labeling. The multistar graph used in this study is a combination of star graphs whose center vertex are not connected to each other. This research uses literature research method which is divided into two parts, that is the basic calculation to determine the boundary of the first term a and the difference d from the (a,d) edge antimagic total labeling on the mS_n multistar graph. The second part is to apply (a,d) edge antimagic total labeling  to the multistar graph mS_n. Further result shown on conclusion. Teori graf memuat beberapa topik, salah satu yang akan dibahas dalam penelitian ini adalah pelabelan graf. Dalam topik pelabelan, graf yang digunakan merupakan graf terbatas, sederhana, dan tak berarah. Dalam penelitian ini, jenis pelabelan yang digunakan adalah pelabelan total. Graf multistar yang digunakan dalam penelitian ini merupakan gabungan graf star yang titik pusatnya tidak saling terhubung. Penelitian ini menggunakan metode penelitian pustaka yang dibagi menjadi dua bagian, yakni perhitungan dasar untuk menentukan batas suku pertama a dan beda d dari pelabelan total tak-ajaib sisi (a,d) pada graf multistar mS_n. Bagian yang kedua adalah keberlakukan pelabelan total tak-ajaib sisi (a,d) pada graf multistar mS_n. Hasil lebih lanjut dijelaskan pada bagian kesimpulan.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-6
Author(s):  
Fu-Tao Hu

The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we have not known the values of these two parameters of the (n,k)-star graph since it was proposed. In this paper, we show a maximum independent sets partition of (n,k)-star graph. From that, we can immediately deduce the exact value of the independent number and chromatic number of (n,k)-star graph.


1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.


2018 ◽  
Vol 6 (10) ◽  
pp. 722-729 ◽  
Author(s):  
Anwesha Chakraborty ◽  
Trina Dutta ◽  
Sushmita Mondal ◽  
Asoke Nath
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document