{"title":"六个顶点上的初等非QE图","authors":"N. Obata","doi":"10.4036/iis.2023.R.01","DOIUrl":null,"url":null,"abstract":"A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Primary Non-QE Graphs on Six Vertices\",\"authors\":\"N. Obata\",\"doi\":\"10.4036/iis.2023.R.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.\",\"PeriodicalId\":91087,\"journal\":{\"name\":\"Interdisciplinary information sciences\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Interdisciplinary information sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4036/iis.2023.R.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Interdisciplinary information sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4036/iis.2023.R.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
