FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2949289019> ?p ?o ?g. }

• W2949289019 abstract "The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore bound by $epsilon$ are called {it graphs with defect or excess $epsilon$}, respectively. While {it Moore graphs} (graphs with $epsilon=0$) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area. Graphs with defect (excess) 2 satisfy the equation $G_{d,k}(A) = J_n + B$ ($G_{d,k}(A) = J_n-B$), where $A$ denotes the adjacency matrix of the graph in question, $n$ its order, $J_n$ the $ntimes n$ matrix whose entries are all 1's, $B$ the adjacency matrix of a union of vertex-disjoint cycles, and $G_{d,k}(x)$ a polynomial with integer coefficients such that the matrix $G_{d,k}(A)$ gives the number of paths of length at most $k$ joining each pair of vertices in the graph. In particular, if $B$ is the adjacency matrix of a cycle of order $n$ we call the corresponding graphs emph{graphs with cyclic defect or excess}; these graphs are the subject of our attention in this paper. We prove the non-existence of infinitely many such graphs. As the highlight of the paper we provide the asymptotic upper bound of $O(frac{64}3d^{3/2})$ for the number of graphs of odd degree $dge3$ and cyclic defect or excess. This bound is in fact quite generous, and as a way of illustration, we show the non-existence of some families of graphs of odd degree $dge3$ and cyclic defect or excess. Actually, we conjecture that, apart from the Mobius ladder on 8 vertices, no non-trivial graph of any degree $ge 3$ and cyclic defect or excess exists." @default.
• W2949289019 created "2019-06-27" @default.
• W2949289019 creator A5044609877 @default.
• W2949289019 creator A5084137628 @default.
• W2949289019 date "2010-10-28" @default.
• W2949289019 modified "2023-09-27" @default.
• W2949289019 title "On graphs with cyclic defect or excess" @default.
• W2949289019 cites W1515707356 @default.
• W2949289019 cites W1558273801 @default.
• W2949289019 cites W1576727573 @default.
• W2949289019 cites W180810406 @default.
• W2949289019 cites W1986449012 @default.
• W2949289019 cites W2025318306 @default.
• W2949289019 cites W2032748226 @default.
• W2949289019 cites W2042238621 @default.
• W2949289019 cites W2050883310 @default.
• W2949289019 cites W2059998776 @default.
• W2949289019 cites W2094898130 @default.
• W2949289019 cites W2316756619 @default.
• W2949289019 cites W645879618 @default.
• W2949289019 cites W789031382 @default.
• W2949289019 hasPublicationYear "2010" @default.
• W2949289019 type Work @default.
• W2949289019 sameAs 2949289019 @default.
• W2949289019 citedByCount "0" @default.
• W2949289019 crossrefType "posted-content" @default.
• W2949289019 hasAuthorship W2949289019A5044609877 @default.
• W2949289019 hasAuthorship W2949289019A5084137628 @default.
• W2949289019 hasConcept C102192266 @default.
• W2949289019 hasConcept C114614502 @default.
• W2949289019 hasConcept C118615104 @default.
• W2949289019 hasConcept C132525143 @default.
• W2949289019 hasConcept C134306372 @default.
• W2949289019 hasConcept C160446614 @default.
• W2949289019 hasConcept C180356752 @default.
• W2949289019 hasConcept C206815938 @default.
• W2949289019 hasConcept C33923547 @default.
• W2949289019 hasConcept C77553402 @default.
• W2949289019 hasConcept C80899671 @default.
• W2949289019 hasConceptScore W2949289019C102192266 @default.
• W2949289019 hasConceptScore W2949289019C114614502 @default.
• W2949289019 hasConceptScore W2949289019C118615104 @default.
• W2949289019 hasConceptScore W2949289019C132525143 @default.
• W2949289019 hasConceptScore W2949289019C134306372 @default.
• W2949289019 hasConceptScore W2949289019C160446614 @default.
• W2949289019 hasConceptScore W2949289019C180356752 @default.
• W2949289019 hasConceptScore W2949289019C206815938 @default.
• W2949289019 hasConceptScore W2949289019C33923547 @default.
• W2949289019 hasConceptScore W2949289019C77553402 @default.
• W2949289019 hasConceptScore W2949289019C80899671 @default.
• W2949289019 hasLocation W29492890191 @default.
• W2949289019 hasOpenAccess W2949289019 @default.
• W2949289019 hasPrimaryLocation W29492890191 @default.
• W2949289019 hasRelatedWork W1610106912 @default.
• W2949289019 hasRelatedWork W172085533 @default.
• W2949289019 hasRelatedWork W1983443477 @default.
• W2949289019 hasRelatedWork W2019781231 @default.
• W2949289019 hasRelatedWork W2051775268 @default.
• W2949289019 hasRelatedWork W2055241540 @default.
• W2949289019 hasRelatedWork W2060159282 @default.
• W2949289019 hasRelatedWork W2079814601 @default.
• W2949289019 hasRelatedWork W2271661788 @default.
• W2949289019 hasRelatedWork W2551566475 @default.
• W2949289019 hasRelatedWork W2914250110 @default.
• W2949289019 hasRelatedWork W2942436526 @default.
• W2949289019 hasRelatedWork W2947834848 @default.
• W2949289019 hasRelatedWork W2953286865 @default.
• W2949289019 hasRelatedWork W2989730026 @default.
• W2949289019 hasRelatedWork W2999454811 @default.
• W2949289019 hasRelatedWork W3048465552 @default.
• W2949289019 hasRelatedWork W3093421916 @default.
• W2949289019 hasRelatedWork W3153244529 @default.
• W2949289019 hasRelatedWork W3201704520 @default.
• W2949289019 isParatext "false" @default.
• W2949289019 isRetracted "false" @default.
• W2949289019 magId "2949289019" @default.
• W2949289019 workType "article" @default.