Update search
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
Filter
- All
- Title
- Author
- Author Affiliations
- Full Text
- Abstract
- Keyword
- DOI
- ISBN
- EISBN
- ISSN
- EISSN
- Issue
- Volume
- References
NARROW
Format
Journal
Type
Date
Availability
1-2 of 2
Keywords: 05C40
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Arab Journal of Mathematical Sciences (2025) 31 (2): 143–152.
Published: 16 July 2024
... Cartesian product of graphs 05C75 05C63 05C40 06A05 Let G = (V, E) be a graph. A graph G′ = (V′, E′) is a subgraph of G if V′ ⊆ V and E′ ⊆ E. Given a non-empty vertex subset X of V...
Journal Articles
Arab Journal of Mathematical Sciences (2021) 27 (1): 94–103.
Published: 19 August 2020
... Hypercube 05C25 05C40 For 1 ≤ i ≤ ⌈ n − 1 m + 1 ⌉ − 1 , let H i be the subgraph of G with i ( m + 1 ) as the central vertex and i ( m + 1 ) − 1 , … , i ( m + 1 ) − m as the end vertices and hence...
