논문KCI 등재
On colorings of strongly multiplicative and strongly quotient graphs
1
조회
0
다운로드
1
인용
0
참고문헌
주제분류수학
초록
Abstract
Computations of the chromatic number Â(G), the clique number !(G), the cardinality of maximal independent set (G) and the cardinality of minimum de¯ning set d(G; Â) for general graph is difficult. In this paper, we obtain two upper bounds and a lower bound for Â(G) where G is a strongly multiplicative graph of order n. If G is a strongly quotient graph of order n, we provide a lower bound for Â(G), and establish that !(G) = 1+¼(n):We also determine the size of a maximal independent set and minimum defining set of a strongly quotient graph of order n.
참고문헌 (10)
- Adiga, C., "On the strongly multi-plicative graphs", South East Asian J.Math and Math.Sc., 2, pp.45~47 (2003)
- Adiga, C., "A note on strongly multi-plicative graphs", Discuss. Math. Graph Theory, 24, pp.81~83 (2004)
- Adiga, C., "Strongly quotient graphs", communicated for publication
- Adiga, C., "An upper bound for maximum number of edges in a strongly multiplicative graph", Discuss. Math. Graph Theory, 26, pp.225~229 (2006)
- Alon, N., "A fast and simple randomized parallel algorithm for the maximal independent set problem", Journal of Algorithms, 7, pp.567~583 (1986)
- Beineke, L.W., "Strongly multiplicative graphs", Discuss. Math. Graph Theory, 21, pp.63~76 (2001)
- Zaferani, R. Kafshgar, "The maximum number of edges in a strongly multiplicative graph", Bull. Iranian Math. Soc., 31(2), pp.53~56 (2005)
- Karp, R.M., "A fast parallel algorithm for the maximal independent set problem", 16th ACM STOC, pp.266~272 (1984)
- Mahmoodian, E.S., "Defining sets in vertex colorings of graphs and latin rectangles", Discrete Math., 167, pp.451~460 (1997)
- Mojdeh, D.A., "On the de¯ning number of (2n ¡ 2)-vertex colorings of Kn £ Kn", Bull. Iranian Math. Soc., 31(1), pp.49~61 (2005)
관련 논문AI추천
Neighborhood Coloring Number of a GraphCharles Dominic, L. Pushpalatha장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2010 · 제13권 제1호On r-dynamic coloring of edge Coronation of graphDafik, LOKESHA. V, NANDINI.G, VENKATACHALAM. M장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2025 · 제28권 제3호On the Basis Number of the Semi-Strong Product of Bipartite Graphs with CyclesMaref Y. Alzoubi, M. M. M. Jaradat경북대학교 자연과학대학 수학과 · Kyungpook Mathematical Journal2005 · 제45권 제1호A proper total coloring distinguishing adjacent vertices by sums of some product graphs김동석, 이성진, 최하나, YEONHEE LEE대한수학회 · 대한수학회논문집2015 · 제30권 제1호On uniquely 3-list colorable graphsH. Abdollahzadeh Ahangar, L. Pushpalatha, S.M. Sheikholeslami, Yancai Zhao장전수학회 · Advanced Studies in Contemporary Mathematics2012 · 제22권 제4호On the defining number and strong defining number for vertex colourings of Jahangir graphsN.D. Soner, Z. Tahmasbzadehbaee장전수학회 · Advanced Studies in Contemporary Mathematics2012 · 제22권 제3호
이 간행물의 다른 논문 (10건)
Ward's “calculus of sequences”, q-calculus and the limit q->-1M. Schorkpp. 131-141Van der Waerden's continuity theorem for the commutator subgroups of connected Lie groups and Mishchenko's conjectureA. I. Shternpp. 143-158A note on the alternating sums of powers of consecutive q-integersS.-H. Rim, T. Kim, Y. Simsekpp. 159-164The weighted Heron dual mean in variablesZh.-H. Zhang, V. Lokeshapp. 165-170Logarithmetically complete monotonicity properties for the ratio of gamma functionW.-Z. Zhao, A.-J. Li, C.-P. Chenpp. 183-191