No label defined (Q4492774)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1481749
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1481749

      Statements

      0 references
      0 references
      26 July 2000
      0 references
      Szeged index
      0 references
      hexagonal chains
      0 references
      If \(e=uv\) is an edge of a graph \(G\), then \(n_u\) (resp. \(n_v\)) denotes the number vertices of \(G\) which are closer to \(u\) (resp. \(v\)), than to \(v\) (resp. \(u\)) according to the distance. The Szeged index of \(G\) is \[ Sz(G)=\sum_{e\in E(G)}n_{u}(e)n_{v}(e). \] A hexagonal chain \(H\) is a graph composed of congruent regular hexagons any two having an edge in common or being disjoint. \(C_h\) denotes a hexagonal chain consisting of \(h\) hexagons. A segment \(S\) of a hexagonal chain \(H\) is a maximal connected subgraph formed by a linear array of hexagons. The number of hexagons in a segment \(S\) is its length and is denoted by \(l(S)\). A segment is odd (resp. even) if its length is odd (resp. even). Let \(L_{o}(H)=\sum_{l_i \text{odd}}(l_i + 1)\) and \(L_{e}(H)=\sum_{l_i \text{even}}(l_i + 1)\). The number of all segments of \(H\) is denoted by \(n(H)\) or simply \(n\). The main result is the following: Let \(H\) and \(H'\) be hexagonal chains from \(C_h\). If \(h\) is odd, then \(\text{Sz}(H)\equiv \text{Sz}(H')\pmod {16k}\) iff \(L_e\equiv L_{e}^{'}\pmod {4k}\), \(k=1,2\). If \(h\) is even, then \(\text{Sz}(H)\equiv \text{Sz}(H')\pmod {16}\) iff \(L_o+2n\equiv L_{o}^{'}+2n'\pmod 4\).
      0 references

      Identifiers