Articoli di riviste sul tema "Quasi-Bipartite graph"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-24 articoli di riviste per l'attività di ricerca sul tema "Quasi-Bipartite graph".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
Ma, Junye, Qingguo Li e Hui Li. "Some properties about the zero-divisor graphs of quasi-ordered sets". Journal of Algebra and Its Applications 19, n. 04 (12 giugno 2019): 2050074. http://dx.doi.org/10.1142/s0219498820500747.
Testo completoAnsari-Toroghy, Habibollah, Shokoufeh Habibi e Masoomeh Hezarjaribi. "On the graph of modules over commutative rings II". Filomat 32, n. 10 (2018): 3657–65. http://dx.doi.org/10.2298/fil1810657a.
Testo completoKumar, P. Ramana Vijaya, e Dr Bhuvana Vijaya. "Applications of Hamiltonian Cycle from Quasi Spanning Tree of Faces based Bipartite Graph". Journal of Advanced Research in Dynamical and Control Systems 11, n. 12-SPECIAL ISSUE (31 dicembre 2019): 505–12. http://dx.doi.org/10.5373/jardcs/v11sp12/20193245.
Testo completoNaji Hameed, Zainab, e Hiyam Hassan Kadhem. "On Degree Topology and Set-T_0 space". Wasit Journal of Computer and Mathematics Science 1, n. 4 (31 dicembre 2022): 213–19. http://dx.doi.org/10.31185/wjcm.91.
Testo completoRowlinson, Peter. "More on graphs with just three distinct eigenvalues". Applicable Analysis and Discrete Mathematics 11, n. 1 (2017): 74–80. http://dx.doi.org/10.2298/aadm161111033r.
Testo completoYu, Guidong, Gaixiang Cai, Miaolin Ye e Jinde Cao. "Energy Conditions for Hamiltonicity of Graphs". Discrete Dynamics in Nature and Society 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/305164.
Testo completoLai, Xinsheng, Yuren Zhou, Xiaoyun Xia e Qingfu Zhang. "Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems". Evolutionary Computation 25, n. 4 (dicembre 2017): 707–23. http://dx.doi.org/10.1162/evco_a_00200.
Testo completoChen, Junpu, e Hong Xie. "An Online Learning Approach to Sequential User-Centric Selection Problems". Proceedings of the AAAI Conference on Artificial Intelligence 36, n. 6 (28 giugno 2022): 6231–38. http://dx.doi.org/10.1609/aaai.v36i6.20572.
Testo completoZhao, Pan, Wenlei Guo, Datong Xu, Zhiliang Jiang, Jie Chai, Lijun Sun, He Li e Weiliang Han. "Hypergraph-based resource allocation for Device-to-Device underlay H-CRAN network". International Journal of Distributed Sensor Networks 16, n. 8 (agosto 2020): 155014772095133. http://dx.doi.org/10.1177/1550147720951337.
Testo completoGröpl, Clemens, Stefan Hougardy, Till Nierhoff e Hans Jürgen Prömel. "Steiner trees in uniformly quasi-bipartite graphs". Information Processing Letters 83, n. 4 (agosto 2002): 195–200. http://dx.doi.org/10.1016/s0020-0190(01)00335-0.
Testo completoBagheri Gh., Behrooz, Tomas Feder, Herbert Fleischner e Carlos Subi. "On Finding Hamiltonian Cycles in Barnette Graphs". Fundamenta Informaticae 188, n. 1 (27 dicembre 2022): 1–14. http://dx.doi.org/10.3233/fi-222139.
Testo completoLiu, Meng, e Yusheng Li. "Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs". Discrete Mathematics 344, n. 1 (gennaio 2021): 112162. http://dx.doi.org/10.1016/j.disc.2020.112162.
Testo completoBen-Ari, Iddo, Hugo Panzo, Philip Speegle e R. Oliver VandenBerg. "Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs". Latin American Journal of Probability and Mathematical Statistics 18, n. 1 (2021): 421. http://dx.doi.org/10.30757/alea.v18-19.
Testo completoAlbuquerque, C. D., R. Palazzo Jr. e E. B. Silva. "New classes of TQC associated with self-dual, quasi self-dual and denser tessellations". Quantum Information and Computation 10, n. 11&12 (novembre 2010): 956–70. http://dx.doi.org/10.26421/qic10.11-12-6.
Testo completoMA, XIAOBIN, e FAN JIANG. "A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS". Bulletin of the Australian Mathematical Society, 25 aprile 2022, 1–6. http://dx.doi.org/10.1017/s000497272200034x.
Testo completoMA, XIAOBIN, e FAN JIANG. "A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS". Bulletin of the Australian Mathematical Society, 25 aprile 2022, 1–6. http://dx.doi.org/10.1017/s000497272200034x.
Testo completoKothari, Nishad, Marcelo H. De Carvalho, Cláudio L. Lucchesi e Charles H. C. Little. "On Essentially 4-Edge-Connected Cubic Bricks". Electronic Journal of Combinatorics 27, n. 1 (24 gennaio 2020). http://dx.doi.org/10.37236/8594.
Testo completoFéray, Valentin. "Cyclic inclusion-exclusion and the kernel of P -partitions". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings, 28th... (22 aprile 2020). http://dx.doi.org/10.46298/dmtcs.6344.
Testo completoFernández, Blas, Marija Maksimović e Sanja Rukavina. "Characterizing Bipartite Distance-Regularized Graphs with Vertices of Eccentricity 4". Bulletin of the Malaysian Mathematical Sciences Society 47, n. 3 (29 aprile 2024). http://dx.doi.org/10.1007/s40840-024-01690-8.
Testo completoRizzi, Romeo. "On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Graphs". BRICS Report Series 6, n. 39 (9 dicembre 1999). http://dx.doi.org/10.7146/brics.v6i39.20108.
Testo completoHrgovčić, Hrvoje J. "Brownian-Huygens Propagation: Modeling Wave Functions with Discrete Particle-Antiparticle Random Walks". International Journal of Theoretical Physics 61, n. 9 (27 settembre 2022). http://dx.doi.org/10.1007/s10773-022-05217-4.
Testo completoLozano, Álvaro, Rubén Vigara, Carmen Mayora-Cebollero e Roberto Barrio. "Dominant patterns in small directed bipartite networks: ubiquitous generalized tripod gait". Nonlinear Dynamics, 20 giugno 2024. http://dx.doi.org/10.1007/s11071-024-09830-2.
Testo completoRaeisi, G., e M. Gholami. "On a class of column‐weight 3 decomposable LDPC codes with the analysis of elementary trapping sets". IET Communications, 22 aprile 2024. http://dx.doi.org/10.1049/cmu2.12762.
Testo completoPolcyn, Joanna. "Large Holes in Quasi-Random Graphs". Electronic Journal of Combinatorics 15, n. 1 (18 aprile 2008). http://dx.doi.org/10.37236/784.
Testo completo