Snježana Majstorović, Martin Knor, Riste Škrekovski
{"title":"Graphs preserving total distance upon vertex removal","authors":"Snježana Majstorović, Martin Knor, Riste Škrekovski","doi":"10.1016/j.endm.2018.06.019","DOIUrl":"10.1016/j.endm.2018.06.019","url":null,"abstract":"<div><p>The total distance or Wiener index <span><math><mi>W</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of a connected graph <em>G</em> is defined as the sum of distances between all pairs of vertices in <em>G</em>. In 1991, Šoltés posed the problem of finding all graphs <em>G</em> such that the equality <span><math><mi>W</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>W</mi><mo>(</mo><mi>G</mi><mo>−</mo><mi>v</mi><mo>)</mo></math></span> holds for all their vertices <em>v</em>. Up to now, the only known graph with this property is the cycle <em>C</em><sub>11</sub>. Our main object of study is a relaxed version of this problem: Find graphs for which total distance does not change when a particular vertex is removed. We show that there are infinitely many graphs that satisfy this property. This gives hope that Šoltes's problem may have also some solutions distinct from <em>C</em><sub>11</sub>.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 107-112"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dyck-Eulerian digraphs","authors":"Pietro Codara , Ottavio M. D'Antona","doi":"10.1016/j.endm.2018.06.041","DOIUrl":"10.1016/j.endm.2018.06.041","url":null,"abstract":"<div><p>We introduce a family of Eulerian digraphs, <span><math><mi>E</mi></math></span>, associated with Dyck words. We provide the algorithms implementing the bijection between <span><math><mi>E</mi></math></span> and <span><math><mi>W</mi></math></span>, the set of Dyck words. To do so, we exploit a binary matrix, that we call <em>Dyck matrix</em>, representing the cycles of an Eulerian digraph.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 239-244"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.041","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124985359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs","authors":"José Aliste-Prieto , José Zamora , Anna de Mier","doi":"10.1016/j.endm.2018.06.032","DOIUrl":"10.1016/j.endm.2018.06.032","url":null,"abstract":"<div><p>In this abstract, we construct explicitly, for every <em>k</em>, pairs of non-isomorphic trees with the same restricted <em>U</em>-polynomial; by this we mean that the polynomials agree on terms with degree at most <em>k</em>. The construction is done purely in algebraic terms, after introducing and studying a generalization of the <em>U</em>-polynomial to rooted graphs.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 185-190"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128554122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some clustering algorithms in normed planes","authors":"Pedro Martín , Diego Yáñez","doi":"10.1016/j.endm.2018.06.033","DOIUrl":"10.1016/j.endm.2018.06.033","url":null,"abstract":"<div><p>Given two sets of points <em>A</em> and <em>B</em> in a normed plane, we prove that there are two linearly separable sets <span><math><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> and <span><math><msup><mrow><mi>B</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> such that <span><math><mrow><mi>diam</mi></mrow><mo>(</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo><mo>≤</mo><mrow><mi>diam</mi></mrow><mo>(</mo><mi>A</mi><mo>)</mo><mo>,</mo><mrow><mi>diam</mi></mrow><mo>(</mo><msup><mrow><mi>B</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo><mo>≤</mo><mrow><mi>diam</mi></mrow><mo>(</mo><mi>B</mi><mo>)</mo></math></span>, and <span><math><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∪</mo><msup><mrow><mi>B</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>=</mo><mi>A</mi><mo>∪</mo><mi>B</mi></math></span>. As a result, some Euclidean clustering algorithms are adapted to normed planes, for instance, those that minimize the maximum, the sum, or the sum of squares of the diameters (or the radii) of <em>k</em> clusters. Some specific solutions are presented for <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span> and <span><math><mi>k</mi><mo>=</mo><mn>3</mn></math></span> that minimize the diameter of the clusters. The 2-clustering problem when two different bounds are imposed to the diameters is also studied.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 191-196"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.033","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129740422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A characterization of weight-regular partitions of graphs","authors":"Aida Abiad","doi":"10.1016/j.endm.2018.06.050","DOIUrl":"10.1016/j.endm.2018.06.050","url":null,"abstract":"<div><p>A partition <span><math><mi>P</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>V</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>}</mo></math></span> of the vertex set <em>V</em> of a graph is regular if, for all <em>i</em>, <em>j</em>, the number of neighbors which a vertex in <em>V</em><sub><em>i</em></sub> has in the set <em>V</em><sub><em>j</em></sub> is independent of the choice of vertex in <em>V</em><sub><em>i</em></sub>. The natural generalization of a regular partition, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex <span><math><mi>u</mi><mo>∈</mo><mi>V</mi></math></span> a weight which equals the corresponding entry <span><math><msub><mrow><mi>ν</mi></mrow><mrow><mi>u</mi></mrow></msub></math></span> of the Perron eigenvector <strong><em>ν</em></strong>. In this work we investigate when a weight-regular partition of a graph is regular in terms of double stochastic matrices. Inspired by a characterization of regular graphs by Hoffman, we provide a new characterization of weight-regular partitions by using a Hoffman-like polynomial.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 293-298"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122608715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"2-closed abelian permutation groups","authors":"Mariusz Grech, Andrzej Kisielewicz","doi":"10.1016/j.endm.2018.06.015","DOIUrl":"10.1016/j.endm.2018.06.015","url":null,"abstract":"<div><p>In this paper we demonstrate that the result by Zelikovskij concerning Königs problem for abelian permutation groups, reported in a recent survey, is false. We propose in this place two results on 2-closed abelian permutation groups which concern the same topic in a more general setting.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 83-88"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127854687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph","authors":"Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani","doi":"10.1016/j.endm.2018.06.005","DOIUrl":"10.1016/j.endm.2018.06.005","url":null,"abstract":"<div><p>In this paper, we prove that the number of 4-contractible edges (edges that after contraction do not change the connectivity of the initial graph) of a 4-connected graph <em>G</em> is at least <span><math><mo>(</mo><mn>1</mn><mo>/</mo><mn>28</mn><mo>)</mo><msub><mrow><mo>∑</mo></mrow><mrow><mi>x</mi><mo>∈</mo><msub><mrow><mi>V</mi></mrow><mrow><mo>≥</mo><mn>5</mn></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></mrow></msub><msub><mrow><mi>deg</mi></mrow><mrow><mi>G</mi></mrow></msub><mo></mo><mo>(</mo><mi>x</mi><mo>)</mo></math></span>, where <span><math><msub><mrow><mi>V</mi></mrow><mrow><mo>≥</mo><mn>5</mn></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span> denotes the set of those vertices of <em>G</em> which have degree greater than or equal to 5.</p><p>This is the refinement of the result proved by Ando et al. [On the number of 4-contractible edges in 4-connected graphs, <em>J. Combin. Theory Ser. B</em> <strong>99</strong> (2009) 97–109].</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 23-28"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128571251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Elena Cabrera Revuelta, María José Chávez de Diego , Alberto Márquez Pérez
{"title":"The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application","authors":"Elena Cabrera Revuelta, María José Chávez de Diego , Alberto Márquez Pérez","doi":"10.1016/j.endm.2018.06.030","DOIUrl":"10.1016/j.endm.2018.06.030","url":null,"abstract":"<div><p>This work focuses on the visibility of exterior of a polygon. We show a lower bound for the Fortress Problem applied to polygons <em>P</em> having <em>n</em> vertices in terms of the number of reflex vertices, the number of convex vertices and the number of pockets that are found when the convex hull is made on <em>P</em>. The results are related to the task of the geometric data acquisition for architectural surveys through techniques such as laser scanner.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 173-178"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.030","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Javier Cilleruelo , Oriol Serra , Maximilian Wötzel
{"title":"Set systems with distinct sumsets","authors":"Javier Cilleruelo , Oriol Serra , Maximilian Wötzel","doi":"10.1016/j.endm.2018.06.004","DOIUrl":"10.1016/j.endm.2018.06.004","url":null,"abstract":"<div><p>A family <span><math><mi>A</mi></math></span> of <em>k</em>-subsets of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>N</mi><mo>}</mo></math></span> is a Sidon system if the sumsets <span><math><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><mi>A</mi><mo>,</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>A</mi></math></span> are pairwise distinct. We show that the largest cardinality <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> of a Sidon system of <em>k</em>-subsets of <span><math><mo>[</mo><mi>N</mi><mo>]</mo></math></span> satisfies <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>≤</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>N</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mi>N</mi><mo>−</mo><mi>k</mi></math></span> and the asymptotic lower bound <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>Ω</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><msup><mrow><mi>N</mi></mrow><mrow><mi>k</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></math></span>. More precise bounds on <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>N</mi><mo>)</mo></math></span> are obtained for <span><math><mi>k</mi><mo>≤</mo><mn>3</mn></math></span>. We also obtain the threshold probability for a random system to be Sidon for <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span> and 3.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 17-22"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On a problem of Sárközy and Sós for multivariate linear forms","authors":"Juanjo Rué , Christoph Spiegel","doi":"10.1016/j.endm.2018.06.018","DOIUrl":"10.1016/j.endm.2018.06.018","url":null,"abstract":"<div><p>We prove that for pairwise co-prime numbers <span><math><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>d</mi></mrow></msub><mo>≥</mo><mn>2</mn></math></span> there does not exist any infinite set of positive integers <span><math><mi>A</mi></math></span> such that the representation function <span><math><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mi>#</mi><mo>{</mo><mo>(</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>d</mi></mrow></msub><mo>)</mo><mo>∈</mo><msup><mrow><mi>A</mi></mrow><mrow><mi>d</mi></mrow></msup><mo>:</mo><msub><mrow><mi>k</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mo>…</mo><mo>+</mo><msub><mrow><mi>k</mi></mrow><mrow><mi>d</mi></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mi>d</mi></mrow></msub><mo>=</mo><mi>n</mi><mo>}</mo></math></span> becomes constant for <em>n</em> large enough. This result is a particular case of our main theorem, which poses a further step towards answering a question of Sárközy and Sós and widely extends a previous result of Cilleruelo and Rué for bivariate linear forms (Bull. of the London Math. Society 2009).</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"68 ","pages":"Pages 101-106"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125854341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}