Bibliografías temáticas / Signed hypercubes / Artículos de revistas

Artículos de revistas sobre el tema "Signed hypercubes"

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Signed hypercubes.
Autor: Grafiati
Publicado: 20 de abril de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Signed hypercubes".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Shi, Wei. "The signed (|G| –1)-subdomination number of balanced hypercubes". Journal of Physics: Conference Series 1978, n.º 1 (1 de julio de 2021): 012040. http://dx.doi.org/10.1088/1742-6596/1978/1/012040.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Lobov, Alexander A. y Mikhail B. Abrosimov. "About uniqueness of the minimal 1-edge extension of hypercube Q4". Prikladnaya Diskretnaya Matematika, n.º 58 (2023): 84–93. http://dx.doi.org/10.17223/20710410/58/8.

Texto completo
Resumen
One of the important properties of reliable computing systems is their fault tolerance. To study fault tolerance, you can use the apparatus of graph theory. Minimal edge extensions of a graph are considered, which are a model for studying the failure of links in a computing system. A graph G* = (V*,α*) with n vertices is called a minimal k-edge extension of an n-vertex graph G = (V, α) if the graph G is embedded in every graph obtained from G* by deleting any of its k edges and has the minimum possible number of edges. The hypercube Qn is a regular 2n-vertex graph of order n, which is the Cartesian product of n complete 2-vertex graphs K2. The hypercube is a common topology for building computing systems. Previously, a family of graphs Q*n was described, whose representatives for n>1 are minimal edge 1-extensions of the corresponding hypercubes. In this paper, we obtain an analytical proof of the uniqueness of minimal edge 1-extensions of hypercubes for n≤4 and establish a general property of an arbitrary minimal edge 1-extension of a hypercube Qn for n>2: it does not contain edges connecting vertices, the distance between which in the hypercube is equal to 2.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Mou, Gufang y Qiuyan Zhang. "Signed zero forcing number and controllability for a networks system with a directed hypercube". MATEC Web of Conferences 355 (2022): 01012. http://dx.doi.org/10.1051/matecconf/202235501012.

Texto completo
Resumen
The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks. In this paper, the problem of controllability of the directed network for a family of matrices carrying the structure under directed hypercube is considered. The relationship between the minimum number of leaders for the directed network system and the number of the signed zero forcing set is established. The minimum number of leaders of the directed networks system under a directed hypercube is obtained by computing the zero forcing number of a signed graph.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Seo, Jung-Hyun y Hyeong-Ok Lee. "Design and Analysis of a Symmetric Log Star Graph with a Smaller Network Cost Than Star Graphs". Electronics 10, n.º 8 (20 de abril de 2021): 981. http://dx.doi.org/10.3390/electronics10080981.

Texto completo
Resumen
Graphs are used as models to solve problems in fields such as mathematics, computer science, physics, and chemistry. In particular, torus, hypercube, and star graphs are popular when modeling the connection structure of processors in parallel computing because they are symmetric and have a low network cost. Whereas a hypercube has a substantially smaller diameter than a torus, star graphs have been presented as an alternative to hypercubes because of their lower network cost. We propose a novel log star (LS) that is symmetric and has a lower network cost than a star graph. The LS is an undirected, recursive, and regular graph. In LSn, the number of nodes is n! while the degree is 2log2n − 1 and the diameter is 0.5n(log2n)2 + 0.75nlog2n. In this study, we analyze the basic topological properties of LS. We prove that LSn is a symmetrical connected graph and analyzed its subgraph characteristics. Then, we propose a routing algorithm and derive the diameter and network cost. Finally, the network costs of the LS and star graph-like networks are compared.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Tsai, Chang-Hsiung y Shu-Yun Jiang. "Path bipancyclicity of hypercubes". Information Processing Letters 101, n.º 3 (febrero de 2007): 93–97. http://dx.doi.org/10.1016/j.ipl.2006.08.011.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Gregor, Petr y Tomáš Dvořák. "Path partitions of hypercubes". Information Processing Letters 108, n.º 6 (noviembre de 2008): 402–6. http://dx.doi.org/10.1016/j.ipl.2008.07.015.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Chen, Xie-Bin. "On path bipancyclicity of hypercubes". Information Processing Letters 109, n.º 12 (mayo de 2009): 594–98. http://dx.doi.org/10.1016/j.ipl.2009.02.009.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Ma, Meijie y Baodong Liu. "Cycles embedding in exchanged hypercubes". Information Processing Letters 110, n.º 2 (diciembre de 2009): 71–76. http://dx.doi.org/10.1016/j.ipl.2009.10.009.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Loh, P. K. K., W. J. Hsu y Y. Pan. "The exchanged hypercube". IEEE Transactions on Parallel and Distributed Systems 16, n.º 9 (septiembre de 2005): 866–74. http://dx.doi.org/10.1109/tpds.2005.113.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Cybenko, George, David W. Krumme y K. N. Venkataraman. "Fixed hypercube embedding". Information Processing Letters 25, n.º 1 (abril de 1987): 35–39. http://dx.doi.org/10.1016/0020-0190(87)90090-1.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

LU, Xiao-Nan y Tomoko ADACHI. "On Dimensionally Orthogonal Diagonal Hypercubes". IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E103.A, n.º 10 (1 de octubre de 2020): 1211–17. http://dx.doi.org/10.1587/transfun.2019dmp0009.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Tsai, Chang-Hsiung, Jimmy J. M. Tan, Tyne Liang y Lih-Hsing Hsu. "Fault-tolerant hamiltonian laceability of hypercubes". Information Processing Letters 83, n.º 6 (septiembre de 2002): 301–6. http://dx.doi.org/10.1016/s0020-0190(02)00214-4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Chang, Chung-Haw, Cheng-Kuan Lin, Hua-Min Huang y Lih-Hsing Hsu. "The super laceability of the hypercubes". Information Processing Letters 92, n.º 1 (octubre de 2004): 15–21. http://dx.doi.org/10.1016/j.ipl.2004.06.006.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Shih, Lun-Min, Jimmy J. M. Tan y Lih-Hsing Hsu. "Edge-bipancyclicity of conditional faulty hypercubes". Information Processing Letters 105, n.º 1 (diciembre de 2007): 20–25. http://dx.doi.org/10.1016/j.ipl.2007.07.009.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

Ma, Meijie y Liying Zhu. "The super connectivity of exchanged hypercubes". Information Processing Letters 111, n.º 8 (marzo de 2011): 360–64. http://dx.doi.org/10.1016/j.ipl.2011.01.006.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Klavžar, Sandi y Meijie Ma. "The domination number of exchanged hypercubes". Information Processing Letters 114, n.º 4 (abril de 2014): 159–62. http://dx.doi.org/10.1016/j.ipl.2013.12.005.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Chen, Xie-Bin. "Hamiltonicity of hypercubes with faulty vertices". Information Processing Letters 116, n.º 5 (mayo de 2016): 343–46. http://dx.doi.org/10.1016/j.ipl.2015.09.018.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Xu, Jun-Ming, Zheng-Zhong Du y Min Xu. "Edge-fault-tolerant edge-bipancyclicity of hypercubes". Information Processing Letters 96, n.º 4 (noviembre de 2005): 146–50. http://dx.doi.org/10.1016/j.ipl.2005.06.006.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

Tsai, Chang-Hsiung. "Cycles embedding in hypercubes with node failures". Information Processing Letters 102, n.º 6 (junio de 2007): 242–46. http://dx.doi.org/10.1016/j.ipl.2006.12.016.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
20

Lai, Chia-Jui. "A note on path bipancyclicity of hypercubes". Information Processing Letters 109, n.º 19 (septiembre de 2009): 1129–30. http://dx.doi.org/10.1016/j.ipl.2009.07.007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
21

Yonta, Paulin Melatagia, Maurice Tchuente y René Ndoundam. "Routing automorphisms of the hypercube". Information Processing Letters 110, n.º 20 (septiembre de 2010): 854–60. http://dx.doi.org/10.1016/j.ipl.2010.07.002.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
22

Sabir, Eminjan y Jixiang Meng. "Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes". Information Processing Letters 172 (diciembre de 2021): 106160. http://dx.doi.org/10.1016/j.ipl.2021.106160.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
23

Ye, Deshi y Guochuan Zhang. "Maximizing the throughput of parallel jobs on hypercubes". Information Processing Letters 102, n.º 6 (junio de 2007): 259–63. http://dx.doi.org/10.1016/j.ipl.2007.01.005.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
24

Chen, Xie-Bin. "Some results on topological properties of folded hypercubes". Information Processing Letters 109, n.º 8 (marzo de 2009): 395–99. http://dx.doi.org/10.1016/j.ipl.2008.12.005.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
25

Chen, Xie-Bin. "Edge-fault-tolerant diameter and bipanconnectivity of hypercubes". Information Processing Letters 110, n.º 24 (noviembre de 2010): 1088–92. http://dx.doi.org/10.1016/j.ipl.2010.09.012.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
26

Li, Xiang-Jun y Jun-Ming Xu. "Generalized measures of fault tolerance in exchanged hypercubes". Information Processing Letters 113, n.º 14-16 (julio de 2013): 533–37. http://dx.doi.org/10.1016/j.ipl.2013.04.007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
27

Diaz de Cerio, L., M. Valero-Garcia y A. Gonzalez. "Hypercube algorithms on mesh connected multicomputers". IEEE Transactions on Parallel and Distributed Systems 13, n.º 12 (diciembre de 2002): 1247–60. http://dx.doi.org/10.1109/tpds.2002.1158263.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
28

Chen, Yu-wei. "A Comment on "The Exchanged Hypercube'". IEEE Transactions on Parallel and Distributed Systems 18, n.º 4 (abril de 2007): 576. http://dx.doi.org/10.1109/tpds.2007.1006.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
29

Qian-Ping Gu y Shietung Peng. "Unicast in hypercubes with large number of faulty nodes". IEEE Transactions on Parallel and Distributed Systems 10, n.º 10 (1999): 964–75. http://dx.doi.org/10.1109/71.808128.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
30

Trifonov, Dmitry I. "Flaws of hypercube-like ciphers". Prikladnaya Diskretnaya Matematika, n.º 57 (2022): 52–66. http://dx.doi.org/10.17223/20710410/57/4.

Texto completo
Resumen
The class of block cryptographic XSLP-algorithms called "hypercube" is considered. For algorithms of this class, we obtain estimates for the dispersion index of a linear environment for any number of iterations. It is shown that when choosing a transformation P using generalized de Bruijn graphs for the algorithms under consideration, the avalanche effect may not occur, as a result of which the encryption key can be determined with laboriousness, which is significantly less than the laboriousness of total key testing.
Los estilos APA, Harvard, Vancouver, ISO, etc.
31

Narayanaswani, Chandrasekhar y William Randolph Franklin. "Edge intersection on the hypercube computer". Information Processing Letters 41, n.º 5 (abril de 1992): 257–62. http://dx.doi.org/10.1016/0020-0190(92)90169-v.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
32

Shankar, Ravi V. y Sanjay Ranka. "Hypercube algorithms for operations on quadtrees". Pattern Recognition 25, n.º 7 (julio de 1992): 741–47. http://dx.doi.org/10.1016/0031-3203(92)90137-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
33

Bhandarkar, Suchendra M. "Parallelizing object recognition on the hypercube". Pattern Recognition Letters 13, n.º 6 (junio de 1992): 433–41. http://dx.doi.org/10.1016/0167-8655(92)90050-a.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
34

Fang, Jywe-Fei y Kuan-Chou Lai. "Embedding the incomplete hypercube in books". Information Processing Letters 96, n.º 1 (octubre de 2005): 1–6. http://dx.doi.org/10.1016/j.ipl.2005.05.026.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
35

Wu, Ruei-Yu, Gen-Huey Chen, Jung-Sheng Fu y Gerard J. Chang. "Finding cycles in hierarchical hypercube networks". Information Processing Letters 109, n.º 2 (diciembre de 2008): 112–15. http://dx.doi.org/10.1016/j.ipl.2008.09.007.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
36

Yang, Weihua, Shuli Zhao y Shurong Zhang. "Strong Menger connectivity with conditional faults of folded hypercubes". Information Processing Letters 125 (septiembre de 2017): 30–34. http://dx.doi.org/10.1016/j.ipl.2017.05.001.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
37

MOROTA, Miya, Ryoichi HATAYAMA y Yukio SHIBATA. "Cayley Graph Representation and Graph Product Representation of Hypercubes". IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E94-A, n.º 3 (2011): 946–54. http://dx.doi.org/10.1587/transfun.e94.a.946.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
38

Dybizbański, Janusz y Andrzej Szepietowski. "Hamiltonian cycles and paths in hypercubes with disjoint faulty edges". Information Processing Letters 172 (diciembre de 2021): 106157. http://dx.doi.org/10.1016/j.ipl.2021.106157.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
39

Fu, Jung-Sheng. "Fault-free cycles in folded hypercubes with more faulty elements". Information Processing Letters 108, n.º 5 (noviembre de 2008): 261–63. http://dx.doi.org/10.1016/j.ipl.2008.05.024.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
40

Chen, Meirun y Xiaofeng Guo. "Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes". Information Processing Letters 109, n.º 12 (mayo de 2009): 599–602. http://dx.doi.org/10.1016/j.ipl.2009.02.006.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
41

Du, Zheng-Zhong y Jun-Ming Xu. "A note on cycle embedding in hypercubes with faulty vertices". Information Processing Letters 111, n.º 12 (junio de 2011): 557–60. http://dx.doi.org/10.1016/j.ipl.2011.03.002.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
42

Shih, Jau-Der. "Fault-tolerant wormhole routing for hypercube networks". Information Processing Letters 86, n.º 2 (abril de 2003): 93–100. http://dx.doi.org/10.1016/s0020-0190(02)00477-5.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
43

Li, Xiang-Jun y Jun-Ming Xu. "Edge-fault tolerance of hypercube-like networks". Information Processing Letters 113, n.º 19-21 (septiembre de 2013): 760–63. http://dx.doi.org/10.1016/j.ipl.2013.07.010.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
44

Tsai, Tsung-Han, Y.-Chuang Chen y Jimmy J. M. Tan. "Topological Properties on the Wide and Fault Diameters of Exchanged Hypercubes". IEEE Transactions on Parallel and Distributed Systems 25, n.º 12 (diciembre de 2014): 3317–27. http://dx.doi.org/10.1109/tpds.2014.2307853.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
45

Avresky, D. R. y K. M. Al-Tawil. "Correction to "Embedding and reconfiguration of spanning trees in faulty hypercubes"". IEEE Transactions on Parallel and Distributed Systems 10, n.º 10 (octubre de 1999): 1102. http://dx.doi.org/10.1109/tpds.1999.808160.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
46

Lee-Juan Fan, Chang-Biau Yang y Shyue-Horng Shiau. "Routing algorithms on the bus-based hypercube network". IEEE Transactions on Parallel and Distributed Systems 16, n.º 4 (abril de 2005): 335–48. http://dx.doi.org/10.1109/tpds.2005.49.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
47

Mei, A. y R. Rizzi. "Hypercube computations on partitioned optical passive stars networks". IEEE Transactions on Parallel and Distributed Systems 17, n.º 6 (junio de 2006): 497–507. http://dx.doi.org/10.1109/tpds.2006.72.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
48

Hsieh, Sun-Yuan. "A note on cycle embedding in folded hypercubes with faulty elements". Information Processing Letters 108, n.º 2 (septiembre de 2008): 81. http://dx.doi.org/10.1016/j.ipl.2008.04.003.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
49

Hsieh, Sun-Yuan, Che-Nan Kuo y Hsin-Hung Chou. "A further result on fault-free cycles in faulty folded hypercubes". Information Processing Letters 110, n.º 2 (diciembre de 2009): 41–43. http://dx.doi.org/10.1016/j.ipl.2009.10.003.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
50

Chen, Xie-Bin. "Hamiltonian paths and cycles passing through a prescribed path in hypercubes". Information Processing Letters 110, n.º 2 (diciembre de 2009): 77–82. http://dx.doi.org/10.1016/j.ipl.2009.10.010.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía