20.500.12556/DKUM-66778 A new characterization and a recognition algorithm of Lucas cubes Fibonacci and Lucas cubes are induced subgraphs of hypercubes obtained by excluding certain binary strings from the vertex set. They appear as models for interconnection networks, as well as in chemistry. We derive a characterization of Lucas cubes that is based on a peripheral expansion of a unique convex subgraph of an appropriate Fibonacci cube.This serves as the foundation for a recognition algorithm of Lucas cubes that runs in linear time. graph theory Lucas cubes characterization recognition algorithm teorija grafov Lucasove kocke karakterizacija algoritem prepoznavanja true true true Discrete Mathematics & Theoretical Computer Science Angleški jezik Slovenski jezik Znanstveno delo 2017-07-10 10:08:54 2017-07-10 10:11:32 2026-01-13 12:39:01 2019-07-11 15:58:37 2013 0 0 Str. 31-39 št. 3 Letn. 15 2013 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2012-06-16 2013-09-03 2013-09-25 1365-8050 519.17 8089433 20090376 1365-8050 URN:SI:UM:DK:VOKEECSX Discrete_Mathematics_&_Theoretical_Computer_Science_2013_Taranenko_A_new_characterization_and_a_recognition_algorithm_of_Lucas_cubes.pdf Discrete_Mathematics_&_Theoretical_Computer_Science_2013_Taranenko_A_new_characterization_and_a_recognition_algorithm_of_Lucas_cubes.pdf 1 164961DD7D1EDEC38A4A5766DAB42888 3e92d3279f4335e900674516c5a221d179795e064c62620961926dbb4f4c0806 62f59ca2-7c0e-11eb-bb7a-00155d0001ca 20.500.12556/dkum/2af1ea25-12c7-4120-8466-55c341f6a9d0 https://dk.um.si/Dokument.php?lang=slv&id=113938 http://dmtcs.episciences.org/617 1 https://dk.um.si/Dokument.php?lang=slv&id=113937 Fakulteta za naravoslovje in matematiko 0 0 0