{"title":"关于比赛得分","authors":"T. A. Naikoo","doi":"10.2478/ausi-2018-0013","DOIUrl":null,"url":null,"abstract":"Abstract A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"438 1","pages":"257 - 267"},"PeriodicalIF":0.3000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On scores in tournaments\",\"authors\":\"T. A. Naikoo\",\"doi\":\"10.2478/ausi-2018-0013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.\",\"PeriodicalId\":41480,\"journal\":{\"name\":\"Acta Universitatis Sapientiae Informatica\",\"volume\":\"438 1\",\"pages\":\"257 - 267\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Universitatis Sapientiae Informatica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/ausi-2018-0013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2018-0013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Abstract A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
