<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-UGEBRPWQ</identifier><date>2016</date><creator>Ellahi, Hamid Reza</creator><creator>Fath-Tabar, Gholam Hossein</creator><creator>Gholami, Ahmad</creator><creator>Nasiri, Ramin</creator><relation>documents/doc/U/URN_NBN_SI_doc-UGEBRPWQ_001.pdf</relation><relation>documents/doc/U/URN_NBN_SI_doc-UGEBRPWQ_001.txt</relation><format format_type="volume">11</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 381-389</format><identifier identifier_type="COBISSID">17859417</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-UGEBRPWQ</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">cut edge</subject><subject language_type_id="eng">edge connectivity</subject><subject language_type_id="slv">nepredznačeni laplaceovski Estrada index</subject><subject language_type_id="slv">pol-povezavni sprehod</subject><subject language_type_id="slv">povezavna povezanost</subject><subject language_type_id="slv">prerezna povezava</subject><subject language_type_id="eng">semi-edge walk</subject><subject language_type_id="eng">signless Laplacian Estrada index</subject><subject language_type_id="eng">vertex connectivity</subject><subject language_type_id="slv">vozliščna povezanost</subject><title>On maximum signless Laplacian Estrada index of graphs with given parameters</title></Record>