DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choe, YB | - |
dc.contributor.author | Huber, KT | - |
dc.contributor.author | Koolen, JH | - |
dc.contributor.author | Kwon, YS | - |
dc.contributor.author | Moulton, V | - |
dc.date.accessioned | 2016-04-01T09:07:11Z | - |
dc.date.available | 2016-04-01T09:07:11Z | - |
dc.date.created | 2009-03-05 | - |
dc.date.issued | 2008-02 | - |
dc.identifier.issn | 0195-6698 | - |
dc.identifier.other | 2008-OAK-0000010812 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/29488 | - |
dc.description.abstract | Median graphs are a natural generalisation of trees and hypercubes that are closely related to distributive lattices and graph retracts. In the past decade, they have become of increasing interest to the biological community, where, amongst other things, they are applied to the study of evolutionary relationships within populations. Two simple measures of complexity for a median graph are the number of vertices and the number of maximal induced subcubes. These numbers can be useful in biological applications, and they are also of purely mathematical interest. However, they can be hard to compute in general. Here we present some special families of median graphs where it is possible to find formulae and recursions for these numbers. (c) 2007 Elsevier Ltd. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS LTD ELSEVIER SCIENCE L | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF COMBINATORICS | - |
dc.subject | METRIC-SPACES | - |
dc.subject | NETWORKS | - |
dc.subject | TREES | - |
dc.title | Counting vertices and cubes in median graphs of circular split systems | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1016/j.ejc.2007.02.003 | - |
dc.author.google | Choe, YB | - |
dc.author.google | Huber, KT | - |
dc.author.google | Koolen, JH | - |
dc.author.google | Kwon, YS | - |
dc.author.google | Moulton, V | - |
dc.relation.volume | 29 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 443 | - |
dc.relation.lastpage | 456 | - |
dc.contributor.id | 10200295 | - |
dc.relation.journal | EUROPEAN JOURNAL OF COMBINATORICS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF COMBINATORICS, v.29, no.2, pp.443 - 456 | - |
dc.identifier.wosid | 000253369500010 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 456 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 443 | - |
dc.citation.title | EUROPEAN JOURNAL OF COMBINATORICS | - |
dc.citation.volume | 29 | - |
dc.contributor.affiliatedAuthor | Koolen, JH | - |
dc.identifier.scopusid | 2-s2.0-38549141825 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 2 | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | METRIC-SPACES | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | TREES | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.