<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-LV0WKTL9/c6957165-0fd8-4afc-94ef-2570f9dcfd61/PDF"><dcterms:extent>335 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-LV0WKTL9/83c0a914-ead6-490f-8629-69e450d07a92/TEXT"><dcterms:extent>28 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-LV0WKTL9"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2016</dcterms:issued><dc:creator>Gross, Jonathan L.</dc:creator><dc:creator>Mansour, Toufik</dc:creator><dc:creator>Tucker, Thomas W.</dc:creator><dc:creator>Wang, David G. L.</dc:creator><dc:format xml:lang="sl">letnik:10</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">str. 255-268</dc:format><dc:identifier>COBISSID:17832537</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-LV0WKTL9</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">graph genus polynomials</dc:subject><dc:subject xml:lang="en">log-concavity</dc:subject><dc:subject xml:lang="sl">log-konkavnost</dc:subject><dc:subject xml:lang="sl">realni koreni</dc:subject><dc:subject xml:lang="en">real-rootedness</dc:subject><dc:subject xml:lang="sl">rodovni polinomi grafa</dc:subject><dc:subject xml:lang="en">topological graph theory</dc:subject><dc:subject xml:lang="sl">topološka teorija grafov</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Iterated claws have real-rooted genus polynomials|</dc:title><dc:description xml:lang="sl">We prove that the genus polynomials of the graphs called iterated claws are realrooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously established log-concavity for sequences of graphs constructed by iterative vertex-amalgamation or iterative edgeamalgamation of graphs that satisfy a commonly observable condition on their partitioned genus distributions, even though it had been proved previously that iterative amalgamation does not always preserve real-rootedness of the genus polynomial of the iterated graph. In this paper, the iterated topological operation is adding a claw, rather than vertex- or edge-amalgamation. Our analysis here illustrates some advantages of employing a matrix representation of the transposition of a set of productions</dc:description><dc:description xml:lang="sl">Dokažemo, da imajo rodovni polinomi grafov, imenovanih iterirane klešče, realne korene. To je nadaljevanje našega dela usmerjenega k 25 let stari domnevi, da je rodovna porazdelitev vsakega grafa log-konkavna. Pokazali smo že log-konkavnost za zaporedja grafov, konstruiranih z iterativno vozliščno amalgamacijo ali iterativno povezavno amalgamacijo grafov, ki zadoščajo zelo splošnemu pogoju glede njihovih particioniranih rodovnih porazdelitev, čeprav je bilo predhodno dokazano, da iterativna amalgamacija ne ohranja vselej realnosti korenov rodovnega polinoma iteriranega grafa. V tem članku je iterirana topološka operacija dodajanje klešč, ne pa vozliščna ali povezavna amalgamacija. Naša tukajšnja analiza ilustrira nekaj prednosti uporabe matrične reprezentacije transpozicije množice produkcij</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-LV0WKTL9"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-LV0WKTL9" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-LV0WKTL9/c6957165-0fd8-4afc-94ef-2570f9dcfd61/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-LV0WKTL9/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-LV0WKTL9" /></ore:Aggregation></rdf:RDF>