000			02049nam a22003013a 4500
001			UPMIN-00003211638
003			UPMIN
005			20230209145457.0
008			230209b |||||||| |||| 00| 0 eng d
040			_aDLC _cUPMin _dupmin
041			_aeng
090		0	_aLG993.5 2008 _bA64 S24
100			_aSalvador, Karina Guada Ordoñez _92309
245		4	_aThe exact gossiping problem for seven messages / _cKarina Guada Ordoñez Salvador.
260			_c2008
300			_a32 leaves.
502			_aThesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2008
520	3		_aThis paper studies variation of the gossiping problem, where there are n persons, each one initially has a message. A pair can disseminate all messages they have by making one call. The exact gossiping problem is to determine the minimum number of calls each person to know exactly k messages. This is an extension of the papers by Tsay and Chang, Paredes and Paderanga, where the methods and techniques of Tsay and Chang were utilized for k=7. The study was able to obtain the minimum number of E(n,k) calls required for each person to know exactly k=7 messages, for all values of n7. In attaining the solution, graphs were provided by exhaustion to generate the possible component combinations of G, and made as basis for the general solution. To arrive at the solution, patterns from the results, were utilized and were then proven mathematically. To obtain solution for n7, n can be expressed as n=9m+r for some m0 and 7r15. To solve for the minimum number of E(n,7) calls the n vertices should be arranged into 9m components and the excess number of vertices that is r=n-9m, wherein r takes the values 7r15, which have E(n,k) values obtained from the graph.
650	1	7	_aCall sequences. _92310
650	1	7	_aComponents. _92311
650	1	7	_aGossiping. _92312
650	1	7	_aGossiping _xProblems. _92313
650	1	7	_aGraphs. _92314
658			_aUndergraduate Thesis _cAMAT200, _2BSAM
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c2235 _d2235