Статті в журналах з теми "Graphe simple"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Graphe simple".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Hudry, Olivier. "Application of the “descent with mutations” metaheuristic to a clique partitioning problem." RAIRO - Operations Research 53, no. 3 (July 2019): 1083–95. http://dx.doi.org/10.1051/ro/2018048.
Повний текст джерелаMalik, M. Aslam, and M. Khalid Mahmood. "On Simple Graphs Arising from Exponential Congruences." Journal of Applied Mathematics 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/292895.
Повний текст джерелаVoorhees, Burton, and Alex Murray. "Fixation probabilities for simple digraphs." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, no. 2154 (June 8, 2013): 20120676. http://dx.doi.org/10.1098/rspa.2012.0676.
Повний текст джерелаAzari, M., and A. Iranmanesh. "On the edge-Wiener index of the disjunctive product of simple graphs." Algebra and Discrete Mathematics 30, no. 1 (2020): 1–14. http://dx.doi.org/10.12958/adm242.
Повний текст джерелаAli, Akbar. "Tetracyclic graphs with maximum second Zagreb index: A simple approach." Asian-European Journal of Mathematics 11, no. 05 (October 2018): 1850064. http://dx.doi.org/10.1142/s179355711850064x.
Повний текст джерелаVasanthi, R., and K. Subramanian. "On Vertex Covering Transversal Domination Number of Regular Graphs." Scientific World Journal 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/1029024.
Повний текст джерелаVoorhees, Burton, and Bergerud Ryder. "Simple graph models of information spread in finite populations." Royal Society Open Science 2, no. 5 (May 2015): 150028. http://dx.doi.org/10.1098/rsos.150028.
Повний текст джерелаTROTTA, BELINDA. "RESIDUAL PROPERTIES OF SIMPLE GRAPHS." Bulletin of the Australian Mathematical Society 82, no. 3 (August 18, 2010): 488–504. http://dx.doi.org/10.1017/s0004972710000420.
Повний текст джерелаDevriendt, Karel, and Piet Van Mieghem. "The simplex geometry of graphs." Journal of Complex Networks 7, no. 4 (January 29, 2019): 469–90. http://dx.doi.org/10.1093/comnet/cny036.
Повний текст джерелаBAHR, PATRICK. "Convergence in infinitary term graph rewriting systems is simple." Mathematical Structures in Computer Science 28, no. 8 (August 9, 2018): 1363–414. http://dx.doi.org/10.1017/s0960129518000166.
Повний текст джерелаAbughazalah, Nabilah, Naveed Yaqoob, and Asif Bashir. "Cayley Graphs over LA-Groups and LA-Polygroups." Mathematical Problems in Engineering 2021 (May 10, 2021): 1–9. http://dx.doi.org/10.1155/2021/4226232.
Повний текст джерелаSKULRATTANAKULCHAI, SAN, and HAROLD N. GABOW. "COLORING ALGORITHMS ON SUBCUBIC GRAPHS." International Journal of Foundations of Computer Science 15, no. 01 (February 2004): 21–40. http://dx.doi.org/10.1142/s0129054104002285.
Повний текст джерелаWu, Tongsuo, and Li Chen. "Simple Graphs and Zero-divisor Semigroups." Algebra Colloquium 16, no. 02 (June 2009): 211–18. http://dx.doi.org/10.1142/s1005386709000212.
Повний текст джерелаAmanto, Amanto, Notiragayu Notiragayu, La Zakaria, and Wamiliana Wamiliana. "The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops." Desimal: Jurnal Matematika 4, no. 3 (November 30, 2021): 357–64. http://dx.doi.org/10.24042/djm.v4i3.10006.
Повний текст джерелаYang, Xiaocheng, Mingyu Yan, Shirui Pan, Xiaochun Ye, and Dongrui Fan. "Simple and Efficient Heterogeneous Graph Neural Network." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 9 (June 26, 2023): 10816–24. http://dx.doi.org/10.1609/aaai.v37i9.26283.
Повний текст джерелаHart, James, and Brian Frazier. "Finite Simple Graphs and Their Associated Graph Lattices." Theory and Applications of Graphs 5, no. 2 (2018): 1–20. http://dx.doi.org/10.20429/tag.2018.050206.
Повний текст джерелаTürkmen, Burcu Nişancı, and Gülçin Karaca. "Finitely Generated Simple Graphs." International Journal of Applied Sciences and Smart Technologies 5, no. 2 (December 26, 2023): 191–200. http://dx.doi.org/10.24071/ijasst.v5i2.6739.
Повний текст джерелаKHEIRABADI, M., and A. R. MOGHADDAMFAR. "RECOGNIZING SOME FINITE SIMPLE GROUPS BY NONCOMMUTING GRAPH." Journal of Algebra and Its Applications 11, no. 04 (July 31, 2012): 1250077. http://dx.doi.org/10.1142/s0219498812500776.
Повний текст джерелаALT, HELMUT, ULRICH FUCHS, and KLAUS KRIEGEL. "On the Number of Simple Cycles in Planar Graphs." Combinatorics, Probability and Computing 8, no. 5 (September 1999): 397–405. http://dx.doi.org/10.1017/s0963548399003995.
Повний текст джерелаFÜRER, MARTIN, and SHIVA PRASAD KASIVISWANATHAN. "Approximately Counting Embeddings into Random Graphs." Combinatorics, Probability and Computing 23, no. 6 (July 9, 2014): 1028–56. http://dx.doi.org/10.1017/s0963548314000339.
Повний текст джерелаNieva, Alex Ralph, and Karen P. Nocum. "On Some Properties of Non-traceable Cubic Bridge Graph." European Journal of Pure and Applied Mathematics 15, no. 4 (October 31, 2022): 1536–48. http://dx.doi.org/10.29020/nybg.ejpam.v15i4.4453.
Повний текст джерелаBURNESS, TIMOTHY C., and ELISA COVATO. "ON THE PRIME GRAPH OF SIMPLE GROUPS." Bulletin of the Australian Mathematical Society 91, no. 2 (October 8, 2014): 227–40. http://dx.doi.org/10.1017/s0004972714000707.
Повний текст джерелаDutta, Supriyo, Bibhas Adhikari, and Subhashish Banerjee. "Condition for zero and nonzero discord in graph Laplacian quantum states." International Journal of Quantum Information 17, no. 02 (March 2019): 1950018. http://dx.doi.org/10.1142/s0219749919500187.
Повний текст джерелаCui, Yan, and Chao Dong Cui. "Study on Necessary and Sufficient Conditions for Euler Graph and Hamilton Graph." Advanced Materials Research 1044-1045 (October 2014): 1357–61. http://dx.doi.org/10.4028/www.scientific.net/amr.1044-1045.1357.
Повний текст джерелаKhuluq, Muhammad Husnul, Vira Hari Krisnawati, and Noor Hidayat. "On Group-Vertex-Magic Labeling of Simple Graphs." CAUCHY: Jurnal Matematika Murni dan Aplikasi 8, no. 2 (November 15, 2023): 167–74. http://dx.doi.org/10.18860/ca.v8i2.23621.
Повний текст джерелаDIAO, Y., G. HETYEI, and K. HINSON. "TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY." Journal of Knot Theory and Its Ramifications 18, no. 05 (May 2009): 561–89. http://dx.doi.org/10.1142/s0218216509007075.
Повний текст джерелаLin, Jephian Chin-Hung. "Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups." Electronic Journal of Linear Algebra 31 (February 5, 2016): 42–59. http://dx.doi.org/10.13001/1081-3810.2836.
Повний текст джерелаOuadid, Youssef, Abderrahmane Elbalaoui, Mehdi Boutaounte, Mohamed Fakir, and Brahim Minaoui. "Handwritten tifinagh character recognition using simple geometric shapes and graphs." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 2 (February 1, 2019): 598. http://dx.doi.org/10.11591/ijeecs.v13.i2.pp598-605.
Повний текст джерелаSeidy, Essam EI, Salah ElDin Hussein, and Atef Abo Elkher. "Spectra of some Operations on Graphs." JOURNAL OF ADVANCES IN MATHEMATICS 11, no. 9 (January 8, 2016): 5654–60. http://dx.doi.org/10.24297/jam.v11i9.828.
Повний текст джерелаPardo-Guerra, Sebastian, Vivek Kurien George, Vikash Morar, Joshua Roldan, and Gabriel Alex Silva. "Extending Undirected Graph Techniques to Directed Graphs via Category Theory." Mathematics 12, no. 9 (April 29, 2024): 1357. http://dx.doi.org/10.3390/math12091357.
Повний текст джерелаJiao, Qingju, Han Zhang, Jingwen Wu, Nan Wang, Guoying Liu, and Yongge Liu. "A simple and effective convolutional operator for node classification without features by graph convolutional networks." PLOS ONE 19, no. 4 (April 30, 2024): e0301476. http://dx.doi.org/10.1371/journal.pone.0301476.
Повний текст джерелаYurttas Gunes, Aysun, Hacer Ozden Ayna, and Ismail Naci Cangul. "The Effect of Vertex and Edge Removal on Sombor Index." Symmetry 16, no. 2 (February 1, 2024): 170. http://dx.doi.org/10.3390/sym16020170.
Повний текст джерелаDeb, Swakshar, Sejuti Rahman, and Shafin Rahman. "SEA-GWNN: Simple and Effective Adaptive Graph Wavelet Neural Network." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 10 (March 24, 2024): 11740–48. http://dx.doi.org/10.1609/aaai.v38i10.29058.
Повний текст джерелаHolme, Petter, and Mikael Huss. "Substance graphs are optimal simple-graph representations of metabolism." Chinese Science Bulletin 55, no. 27-28 (September 2010): 3161–68. http://dx.doi.org/10.1007/s11434-010-4086-3.
Повний текст джерелаSolomko, Viktoriia, and Vladyslav Sobolev. "Constructing the Mate of Cospectral 5-regular Graphs with and without a Perfect Matching." Mohyla Mathematical Journal 4 (May 19, 2022): 24–27. http://dx.doi.org/10.18523/2617-70804202124-27.
Повний текст джерелаAlrowaili, Dalal Awadh, Uzma Ahmad, Saira Hameeed, and Muhammad Javaid. "Graphs with mixed metric dimension three and related algorithms." AIMS Mathematics 8, no. 7 (2023): 16708–23. http://dx.doi.org/10.3934/math.2023854.
Повний текст джерелаMathew, Suji Elizabeth, and Sunny Joseph Kalayathankal. "Some Results on Pendant Regular Graphs." Pan-American Journal of Mathematics 2 (November 13, 2023): 12. http://dx.doi.org/10.28919/cpr-pajm/2-12.
Повний текст джерелаMuhammad, Ibrahim, та Abubakar Umar. "Permutation graphs with co-inversion on Γ<sub>1</sub> - non-deranged permutations". Caliphate Journal of Science and Technology 5, № 2 (8 серпня 2023): 127–31. http://dx.doi.org/10.4314/cajost.v5i2.6.
Повний текст джерелаJournal, Baghdad Science. "Tadpole Domination in Graphs." Baghdad Science Journal 15, no. 4 (December 9, 2018): 466–71. http://dx.doi.org/10.21123/bsj.15.4.466-471.
Повний текст джерелаKazi, Sabeena, and Harishchandra Ramane. "Construction And Spectra Of Non-Regular Minimal Graphs." Journal of Engineering and Applied Sciences 9, no. 1 (2022): 30. http://dx.doi.org/10.5455/jeas.2022050103.
Повний текст джерелаSu, Huadong, and Yangjiang Wei. "Semipotent Rings Whose Unit Graphs Are Planar." Algebra Colloquium 27, no. 02 (May 7, 2020): 311–18. http://dx.doi.org/10.1142/s1005386720000255.
Повний текст джерелаGhorbani, Modjtaba, Matthias Dehmer, Shaghayegh Rahmani, and Mina Rajabi-Parsa. "A Survey on Symmetry Group of Polyhedral Graphs." Symmetry 12, no. 3 (March 2, 2020): 370. http://dx.doi.org/10.3390/sym12030370.
Повний текст джерелаERDŐS, PÉTER L., ISTVÁN MIKLÓS, and ZOLTÁN TOROCZKAI. "New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling." Combinatorics, Probability and Computing 27, no. 2 (November 2, 2017): 186–207. http://dx.doi.org/10.1017/s0963548317000499.
Повний текст джерелаThalavayalil, Timmy Tomy, and Sudev Naduvath. "A study on coarse deg-centric graphs." Gulf Journal of Mathematics 16, no. 2 (April 12, 2024): 171–82. http://dx.doi.org/10.56947/gjom.v16i2.1877.
Повний текст джерелаFran, Fransiskus, Nilamsari Kusumastuti, and Robiandi. "BILANGAN KROMATIK HARMONIS PADA GRAF PAYUNG, GRAF PARASUT, DAN GRAF SEMI PARASUT." Jurnal Matematika Sains dan Teknologi 24, no. 1 (May 20, 2023): 15–22. http://dx.doi.org/10.33830/jmst.v24i1.3945.2023.
Повний текст джерелаIranmanesh, Mohammad, and Mahboubeh Saheli. "Toward a Laplacian spectral determination of signed ∞-graphs." Filomat 32, no. 6 (2018): 2283–94. http://dx.doi.org/10.2298/fil1806283i.
Повний текст джерелаAkar H. Karim, Nabeel E. Arif, and Ayad M. Ramadan. "The M-Polynomial and Nirmala index of Certain Composite Graphs." Tikrit Journal of Pure Science 27, no. 3 (November 29, 2022): 92–101. http://dx.doi.org/10.25130/tjps.v27i3.45.
Повний текст джерелаFarzaneh, Amirmohammad, Justin P. Coon, and Mihai-Alin Badiu. "Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis." Entropy 23, no. 12 (November 29, 2021): 1604. http://dx.doi.org/10.3390/e23121604.
Повний текст джерелаImran, Muhammad, Murat Cancan, Muhammad Faisal Nadeem, and Yasir Ali. "Further results on edge irregularity strength of some graphs." Proyecciones (Antofagasta) 43, no. 1 (March 11, 2024): 133–51. http://dx.doi.org/10.22199/issn.0717-6279-6175.
Повний текст джерелаDai, Zemiao, Muhammad Naeem, Zainab Shafaqat, Manzoor Ahmad Zahid, and Shahid Qaisar. "On the P3-Coloring of Bipartite Graphs." Mathematics 11, no. 16 (August 12, 2023): 3487. http://dx.doi.org/10.3390/math11163487.
Повний текст джерела