9 research outputs found
Characterizing All Trees with Locating-chromatic Number 3
Let be a proper -coloring of a connected graph . Let be the induced partition of by , where is the partition class having all vertices with color .The color code of vertex is the ordered-tuple , where, for .If all vertices of have distinct color codes, then iscalled a locating-coloring of .The locating-chromatic number of , denoted by , isthe smallest such that posses a locating -coloring. Clearly, any graph of order have locating-chromatic number , where . Characterizing all graphswith a certain locating-chromatic number is a difficult problem. Up to now, we have known allgraphs of order with locating chromatic number or .In this paper, we characterize all trees whose locating-chromatic number . We also give a family of trees with locating-chromatic number 4
Restricted Size Ramsey Number for Path of Order Three Versus Graph of Order Five
Let and be simple graphs. The Ramsey number for a pair of graph and is the smallest number such that any red-blue coloring of edges of contains a red subgraph or a blue subgraph . The size Ramsey number for a pair of graph and is the smallest number such that there exists a graph with size satisfying the property that any red-blue coloring of edges of contains a red subgraph or a blue subgraph . Additionally, if the order of in the size Ramsey number is , then it is called the restricted size Ramsey number. In 1983, Harary and Miller started to find the (restricted) size Ramsey number for any pair of small graphs with order at most four. Faudree and Sheehan (1983) continued Harary and Miller\u27s works and summarized the complete results on the (restricted) size Ramsey number for any pair of small graphs with order at most four. In 1998, Lortz and Mengenser gave both the size Ramsey number and the restricted size Ramsey number for any pair of small forests with order at most five. To continue their works, we investigate the restricted size Ramsey number for a path of order three versus connected graph of order five
On Energy, Laplacian Energy and -fold Graphs
For a graph having adjacency spectrum (-spectrum) and Laplacian spectrum (-spectrum) , the energy is defined as and the Laplacian energy is defined as . In this paper, we give upper and lower bounds for the energy of and as a consequence we generalize a result of Stevanovic et al. [More on the relation between Energy and Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem. {\bf 61} (2009) 395-401]. We also consider strong double graph and strong -fold graph to construct some new families of graphs for which E(G)> LE(G)
On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles
Let be a complete, balanced, multipartite graph consisting of partite sets and vertices in each partite set. For given two graphs and , and integer , the size multipartite Ramsey number is the smallest integer such that every factorization of the graph satisfies the following condition: either contains or contains . In 2007, Syafrizal et al. determined the size multipartite Ramsey numbers of paths versus stars, for only. Furthermore, Surahmat et al. (2014) gave the size tripartite Ramsey numbers of paths versus stars, for . In this paper, we investigate the size tripartite Ramsey numbers of paths versus stars, with all . Our results complete the previous results given by Syafrizal et al. and Surahmat et al. We also determine the size bipartite Ramsey numbers of stars versus cycles, for
Bilangan Ramsey Sisi dari R(p3,pn)
Pada paper ini akan ditunjukkan bahwa bilangan Ramsey sisi dari r(P3,Pn) untuk n = 13, 14, 15 adalah 20, 23, 24. Ditunjukkan pula bahwa r(P3,pn)=r(P3,Pk)+r(P3,P1) dengan n = k+l-1 untuk n ganjil dan k, l genap.
Kata kunci: Bilangan Ramsey sisi, Graph lintasa