Characterization of Joined Graphs

Authors

  • C. Promsakon Department of Mathematics, Faculty of Applied Science King Mongkut's University of Technology North Bongkok, Thailand, 10800

DOI:

https://doi.org/10.26713/cma.v1i3.121

Keywords:

Joined graphs

Abstract

The join of simple graphs $G_1$ and $G_2$, written by $G_1\vee G_2$, is the graph obtained from the disjoint union between $G_1$ and $G_2$ by adding the edges $\{xy:x\in V(G_1),y\in V(G_2)\}$. We call a simple graph $G$ as a joined graph if there are $G_1$ and $G_2$ that $G=G_1\vee G_2$. In this paper, we give conditions to determine that which graphs are joined graphs and use its properties to investigate the chromatic number of joined graphs.

Downloads

Download data is not yet available.

Downloads

CITATION

How to Cite

Promsakon, C. (2010). Characterization of Joined Graphs. Communications in Mathematics and Applications, 1(3), 139–143. https://doi.org/10.26713/cma.v1i3.121

Issue

Vol. 1 No. 3 (2010)

Section

Research Article

License

Creative Commons Licence 4.0 by  

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.