Matches in SemOpenAlex for { <https://semopenalex.org/work/W2127025148> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W2127025148 endingPage "181" @default.
- W2127025148 startingPage "175" @default.
- W2127025148 abstract "We associate with a graph (finite, undirected, without loops and multiple lines) a graph T ( G ), called the total graph of G . This new graph has the property that a one-to-one correspondence can be established between its points and the elements (points and lines) of G such that two points of T(G) are adjacent if and only if the corresponding elements of G are adjacent or incident. The object of this article is to prove the following theorem: If K(G 1 ) = n, n ≥ 1, and λ(G2) = m, m ≥ 1 , then K(T(G 1 )) ≥ n + 2 + [(n - 2)/3], λ( T (G 1 )) ≥ 2n , K ( T(G 2 )) ≥ m + 1, and λ( T(G 2 )) ≥ 2m , where k ( G ) and λ( G ) denote the connectivity and line-connectivity of the graph G ." @default.
- W2127025148 created "2016-06-24" @default.
- W2127025148 creator A5071907505 @default.
- W2127025148 date "1969-08-01" @default.
- W2127025148 modified "2023-10-18" @default.
- W2127025148 title "The connectivity of total graphs" @default.
- W2127025148 cites W2050483627 @default.
- W2127025148 cites W2052417492 @default.
- W2127025148 cites W2136185791 @default.
- W2127025148 cites W4231597948 @default.
- W2127025148 doi "https://doi.org/10.1017/s0004972700041423" @default.
- W2127025148 hasPublicationYear "1969" @default.
- W2127025148 type Work @default.
- W2127025148 sameAs 2127025148 @default.
- W2127025148 citedByCount "17" @default.
- W2127025148 countsByYear W21270251482013 @default.
- W2127025148 countsByYear W21270251482014 @default.
- W2127025148 countsByYear W21270251482015 @default.
- W2127025148 countsByYear W21270251482016 @default.
- W2127025148 countsByYear W21270251482017 @default.
- W2127025148 countsByYear W21270251482018 @default.
- W2127025148 countsByYear W21270251482020 @default.
- W2127025148 crossrefType "journal-article" @default.
- W2127025148 hasAuthorship W2127025148A5071907505 @default.
- W2127025148 hasBestOaLocation W21270251481 @default.
- W2127025148 hasConcept C113203676 @default.
- W2127025148 hasConcept C114614502 @default.
- W2127025148 hasConcept C118615104 @default.
- W2127025148 hasConcept C132525143 @default.
- W2127025148 hasConcept C149530733 @default.
- W2127025148 hasConcept C203776342 @default.
- W2127025148 hasConcept C33923547 @default.
- W2127025148 hasConcept C76444178 @default.
- W2127025148 hasConceptScore W2127025148C113203676 @default.
- W2127025148 hasConceptScore W2127025148C114614502 @default.
- W2127025148 hasConceptScore W2127025148C118615104 @default.
- W2127025148 hasConceptScore W2127025148C132525143 @default.
- W2127025148 hasConceptScore W2127025148C149530733 @default.
- W2127025148 hasConceptScore W2127025148C203776342 @default.
- W2127025148 hasConceptScore W2127025148C33923547 @default.
- W2127025148 hasConceptScore W2127025148C76444178 @default.
- W2127025148 hasIssue "2" @default.
- W2127025148 hasLocation W21270251481 @default.
- W2127025148 hasOpenAccess W2127025148 @default.
- W2127025148 hasPrimaryLocation W21270251481 @default.
- W2127025148 hasRelatedWork W1858680408 @default.
- W2127025148 hasRelatedWork W1964592620 @default.
- W2127025148 hasRelatedWork W1980395362 @default.
- W2127025148 hasRelatedWork W2032096410 @default.
- W2127025148 hasRelatedWork W2075085574 @default.
- W2127025148 hasRelatedWork W2258672840 @default.
- W2127025148 hasRelatedWork W2368489016 @default.
- W2127025148 hasRelatedWork W2912339235 @default.
- W2127025148 hasRelatedWork W4205475737 @default.
- W2127025148 hasRelatedWork W2985690467 @default.
- W2127025148 hasVolume "1" @default.
- W2127025148 isParatext "false" @default.
- W2127025148 isRetracted "false" @default.
- W2127025148 magId "2127025148" @default.
- W2127025148 workType "article" @default.