Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • reasoning 2015-07-10 Paper An upper bound for the crossing number of augmented cubes 2013-12-23 Paper https://portal.mardi4nfdi.de/entity/Q3017085 2011-07-19...
    10 bytes (16 words) - 12:28, 28 January 2024
  • 2011-08-10 Paper Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes 2009-02-25 Paper Geodesic-pancyclic graphs 2007-09-19 Paper...
    10 bytes (18 words) - 02:47, 25 September 2023
  • improved algorithm to construct edge-independent spanning trees in augmented cubes 2020-03-23 Paper...
    10 bytes (16 words) - 20:25, 6 October 2023
  • of Augmented Cubes AQn 2019-12-19 Paper https://portal.mardi4nfdi.de/entity/Q4683309 2018-09-20 Paper The crossing number of locally twisted cubes \(L...
    10 bytes (17 words) - 02:20, 12 December 2023
  • Publication Date of Publication Type On the \(g\)-extra connectivity of augmented cubes 2023-08-08 Paper A Brief Account on the Development and Future Research...
    10 bytes (16 words) - 22:21, 10 December 2023
  • Node-Independent Spanning Trees in Augmented Cubes 2021-05-20 Paper Communication Performance Evaluation of the Locally Twisted Cube 2021-04-20 Paper The Conditional-(g...
    10 bytes (16 words) - 19:20, 6 October 2023
  • environment 2011-07-21 Paper A note on ``The super connectivity of augmented cubes 2010-08-16 Paper A note about some properties of BC graphs 2010-06-09...
    10 bytes (16 words) - 04:10, 7 October 2023
  • Networks 2022-07-04 Paper Fractional matching preclusion for generalized augmented cubes 2020-01-13 Paper Matching Preclusion of the Generalized Petersen Graph...
    10 bytes (16 words) - 18:52, 24 September 2023
  • 2017-07-12 Paper Maximally local connectivity and connected components of augmented cubes 2016-07-08 Paper Hamiltonian decomposition of generalized recursive...
    10 bytes (18 words) - 19:18, 6 October 2023
  • de/entity/Q3175607 2018-07-18 Paper An upper bound for the crossing number of augmented cubes 2013-12-23 Paper https://portal.mardi4nfdi.de/entity/Q2881277 2012-04-03...
    10 bytes (16 words) - 11:07, 24 September 2023
  • of Publication Type Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes 2023-05-02 Paper A-numerical radius and A-norm inequalities for semi-Hilbertian...
    10 bytes (16 words) - 11:05, 24 September 2023
  • 2023-02-28 Paper \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) 2022-06-17 Paper Adjustable dimension descriptor observer based...
    10 bytes (16 words) - 19:22, 6 October 2023
  • pancyclicity and balanced pancyclicity of augmented cubes 2010-01-29 Paper Constructing the nearly shortest path in crossed cubes 2009-07-22 Paper...
    10 bytes (18 words) - 17:56, 6 October 2023
  • its approximation 2023-02-01 Paper Fault-Tolerant Panconnectivity of Augmented Cubes AQn 2019-12-19 Paper https://portal.mardi4nfdi.de/entity/Q4683309 2018-09-20...
    10 bytes (16 words) - 13:45, 28 January 2024
  • Algorithm 2021-05-28 Paper Constructing Node-Independent Spanning Trees in Augmented Cubes 2021-05-20 Paper 2-D and 3-D measurements of flame stretch and turbulence–flame...
    10 bytes (16 words) - 23:31, 10 December 2023
  • pancyclicity and balanced pancyclicity of augmented cubes 2010-01-29 Paper Constructing the nearly shortest path in crossed cubes 2009-07-22 Paper Globally bi-3*-connected...
    10 bytes (18 words) - 14:35, 6 October 2023
  • 2022-07-15 Paper Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes 2022-07-08 Paper On the 3-Extra Connectivity of Enhanced Hypercubes...
    10 bytes (17 words) - 07:09, 12 December 2023
  • 2022-10-24 Paper \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) 2022-06-17 Paper An efficient neural network method with plane...
    10 bytes (16 words) - 11:57, 6 October 2023
  • Publication Type \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) 2022-06-17 Paper https://portal.mardi4nfdi.de/entity/Q4989594...
    10 bytes (16 words) - 02:04, 7 October 2023
  • number three 2014-03-24 Paper An upper bound for the crossing number of augmented cubes 2013-12-23 Paper https://portal.mardi4nfdi.de/entity/Q4898156 2012-12-29...
    10 bytes (16 words) - 14:54, 6 October 2023
View ( | ) (20 | 50 | 100 | 250 | 500)