MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02049nam a22003013a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
UPMIN-00003211638 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
UPMIN |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230209145457.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230209b |||||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Transcribing agency |
UPMin |
| Modifying agency |
upmin |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
LG993.5 2008 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
A64 S24 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Salvador, Karina Guada Ordoñez |
| 9 (RLIN) |
2309 |
| 245 #4 - TITLE STATEMENT |
|---|
| Title |
The exact gossiping problem for seven messages / |
| Statement of responsibility, etc. |
Karina Guada Ordoñez Salvador. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Date of publication, distribution, etc. |
2008 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
32 leaves. |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2008 |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
This 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 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Call sequences. |
| 9 (RLIN) |
2310 |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Components. |
| 9 (RLIN) |
2311 |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Gossiping. |
| 9 (RLIN) |
2312 |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Gossiping |
| General subdivision |
Problems. |
| 9 (RLIN) |
2313 |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Graphs. |
| 9 (RLIN) |
2314 |
| 658 ## - INDEX TERM--CURRICULUM OBJECTIVE |
|---|
| Main curriculum objective |
Undergraduate Thesis |
| Curriculum code |
AMAT200, |
| Source of term or code |
BSAM |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
|---|
| a |
Fi |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
|---|
| a |
UP |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Thesis |
