BibTex Citation Data :
@article{JM261, author = {Erly L.}, title = {LANGKAH-LANGKAH PENENTUAN SUATU BARISAN}, journal = {MATEMATIKA}, volume = {11}, number = {2}, year = {2010}, keywords = {}, abstract = { Consider a non increasing sequence of non negative integres d = ( d 1 , d 2 , …, d n ) . A sequence d is called a graphic if it is sequnce of degrees on a simple graph with n order. In this paper will be discussed necessary and sufficient conditions of a sequence d be a graphic. And then will be constructed an algorithm to determine a sequence be a graphic, particularly a sequnce with n large order. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/261} }
Refworks Citation Data :
Consider a non increasing sequence of non negative integres d = (d1, d2, …, dn) . A sequence d is called a graphic if it is sequnce of degrees on a simple graph with n order. In this paper will be discussed necessary and sufficient conditions of a sequence d be a graphic. And then will be constructed an algorithm to determine a sequence be a graphic, particularly a sequnce with n large order.
Last update:
Last update: 2024-04-20 21:12:05