Matches in SemOpenAlex for { <https://semopenalex.org/work/W2743284597> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W2743284597 endingPage "3031" @default.
- W2743284597 startingPage "3020" @default.
- W2743284597 abstract "The decycling number ∇(G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycle. A decycling set containing exactly ∇(G) vertices of G is called a ∇-set. For any decycling set S of a k-regular graph G, we show that |S|=β(G)+m(S)k−1, where β(G) is the cycle rank of G, m(S)=c+|E(S)|−1 is the margin number of S, c and |E(S)| are, respectively, the number of components of G−S and the number of edges in G[S]. In particular, for any ∇-set S of a 3-regular graph G, we prove that m(S)=ξ(G), where ξ(G) is the Betti deficiency of G. This implies that the decycling number of a 3-regular graph G is β(G)+ξ(G)2. Hence ∇(G)=⌈β(G)2⌉ for a 3-regular upper-embeddable graph G, which concludes the results in [Gao et al., 2015, Wei and Li, 2013] and solves two open problems posed by Bau and Beineke (2002). Considering an algorithm by Furst et al., (1988), there exists a polynomial time algorithm to compute Z(G), the cardinality of a maximum nonseparating independent set in a 3-regular graph G, which solves an open problem raised by Speckenmeyer (1988). As for a 4-regular graph G, we show that for any ∇-set S of G, there exists a spanning tree T of G such that the elements of S are simply the leaves of T with at most two exceptions providing ∇(G)=⌈β(G)3⌉. On the other hand, if G is a loopless graph on n vertices with maximum degree at most 4, then ∇(G)≤n+12,if G is 4-regular,n2,otherwise.The above two upper bounds are tight, and this makes an extension of a result due to Punnim (2006)." @default.
- W2743284597 created "2017-08-17" @default.
- W2743284597 creator A5033583653 @default.
- W2743284597 creator A5064847057 @default.
- W2743284597 creator A5084918137 @default.
- W2743284597 date "2017-12-01" @default.
- W2743284597 modified "2023-10-18" @default.
- W2743284597 title "A new formula for the decycling number of regular graphs" @default.
- W2743284597 cites W1480688817 @default.
- W2743284597 cites W1543925627 @default.
- W2743284597 cites W1967424311 @default.
- W2743284597 cites W1999238541 @default.
- W2743284597 cites W2002052439 @default.
- W2743284597 cites W2010294998 @default.
- W2743284597 cites W2029673229 @default.
- W2743284597 cites W2043414428 @default.
- W2743284597 cites W2047035505 @default.
- W2743284597 cites W2088320806 @default.
- W2743284597 cites W2136253510 @default.
- W2743284597 cites W2401610261 @default.
- W2743284597 cites W4240625092 @default.
- W2743284597 doi "https://doi.org/10.1016/j.disc.2017.07.011" @default.
- W2743284597 hasPublicationYear "2017" @default.
- W2743284597 type Work @default.
- W2743284597 sameAs 2743284597 @default.
- W2743284597 citedByCount "7" @default.
- W2743284597 countsByYear W27432845972019 @default.
- W2743284597 countsByYear W27432845972020 @default.
- W2743284597 countsByYear W27432845972022 @default.
- W2743284597 countsByYear W27432845972023 @default.
- W2743284597 crossrefType "journal-article" @default.
- W2743284597 hasAuthorship W2743284597A5033583653 @default.
- W2743284597 hasAuthorship W2743284597A5064847057 @default.
- W2743284597 hasAuthorship W2743284597A5084918137 @default.
- W2743284597 hasBestOaLocation W27432845971 @default.
- W2743284597 hasConcept C114614502 @default.
- W2743284597 hasConcept C118615104 @default.
- W2743284597 hasConcept C121134508 @default.
- W2743284597 hasConcept C123482549 @default.
- W2743284597 hasConcept C132525143 @default.
- W2743284597 hasConcept C149530733 @default.
- W2743284597 hasConcept C168291704 @default.
- W2743284597 hasConcept C203776342 @default.
- W2743284597 hasConcept C33923547 @default.
- W2743284597 hasConceptScore W2743284597C114614502 @default.
- W2743284597 hasConceptScore W2743284597C118615104 @default.
- W2743284597 hasConceptScore W2743284597C121134508 @default.
- W2743284597 hasConceptScore W2743284597C123482549 @default.
- W2743284597 hasConceptScore W2743284597C132525143 @default.
- W2743284597 hasConceptScore W2743284597C149530733 @default.
- W2743284597 hasConceptScore W2743284597C168291704 @default.
- W2743284597 hasConceptScore W2743284597C203776342 @default.
- W2743284597 hasConceptScore W2743284597C33923547 @default.
- W2743284597 hasFunder F4320321001 @default.
- W2743284597 hasFunder F4320321885 @default.
- W2743284597 hasIssue "12" @default.
- W2743284597 hasLocation W27432845971 @default.
- W2743284597 hasOpenAccess W2743284597 @default.
- W2743284597 hasPrimaryLocation W27432845971 @default.
- W2743284597 hasRelatedWork W2002373719 @default.
- W2743284597 hasRelatedWork W2022743540 @default.
- W2743284597 hasRelatedWork W2049807202 @default.
- W2743284597 hasRelatedWork W2133252387 @default.
- W2743284597 hasRelatedWork W2161439427 @default.
- W2743284597 hasRelatedWork W2964297912 @default.
- W2743284597 hasRelatedWork W3047902288 @default.
- W2743284597 hasRelatedWork W3099615988 @default.
- W2743284597 hasRelatedWork W4229970255 @default.
- W2743284597 hasRelatedWork W2183902501 @default.
- W2743284597 hasVolume "340" @default.
- W2743284597 isParatext "false" @default.
- W2743284597 isRetracted "false" @default.
- W2743284597 magId "2743284597" @default.
- W2743284597 workType "article" @default.