Advanced search
Publication Cover
Journal of Taibah University for Science Volume 14, 2020 - Issue 1
Submit an article Journal homepage
1,492
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Matching number and characteristic polynomial of a graph

Aysun Yurttas Gunesa Department of Mathematics, Faculty of Arts and Science, Bursa Uludag University, Bursa, TurkeyORCID Iconhttps://orcid.org/0000-0001-8873-1999
ORCID Icon,
Musa Demircia Department of Mathematics, Faculty of Arts and Science, Bursa Uludag University, Bursa, TurkeyCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0002-6439-8439
ORCID Icon,
Mert Sinan Ozb Department of Mathematics, Faculty of Engineering and Natural Sciences, Bursa Technical University, Bursa, TurkeyORCID Iconhttps://orcid.org/0000-0002-6206-0362
ORCID Icon &
Ismail Naci Cangula Department of Mathematics, Faculty of Arts and Science, Bursa Uludag University, Bursa, TurkeyORCID Iconhttps://orcid.org/0000-0002-0700-5774
ORCID Icon
Pages 993-999 | Received 20 Dec 2019, Accepted 11 Jul 2020, Published online: 25 Jul 2020

References

  • Nie W, Ding H, Liu A. Subgraph learning for graph matching. Pattern Recognit Lett. 2020;130:362–369. doi: 10.1016/j.patrec.2018.07.005
  • Liu A, Wang Z, Nie W, et al. Graph-based characteristic view set extraction and matching for 3D model retrieval. Inf Sci (Ny). 2015;320:429–442. doi: 10.1016/j.ins.2015.04.042
  • Gutman I, Zhang F. On the ordering of graphs with respect to their matching numbers. Discrete Appl Math. 1986;15(1):25–33. doi: 10.1016/0166-218X(86)90015-6
  • Zhang H, Chen G. The largest matching roots of unicyclic graphs with a fixed matching number. Cogent Math. 2017;4:1280912.
  • Daoud SN. Complexity of stacked book graph and cone graphs. J Taibah Univ Sci. 2013;7(3):162–172. doi: 10.1016/j.jtusci.2013.04.006
  • Daoud SN, Mohamed K. The complexity of some families of cycle-related graphs. J Taibah Univ Sci. 2017;11(2):205–228. doi: 10.1016/j.jtusci.2016.04.002
  • Salama F. On total edge irregularity strength of polar grid graph. J Taibah Univ Sci. 2019;13(1):912–916. doi: 10.1080/16583655.2019.1660086
  • Ascioglu M, Cangul IN. Narumi-Katayama index of the subdivision graphs. J Taibah Univ Sci. 2018;12(4):401–408. doi: 10.1080/16583655.2018.1474542
  • Oz MS, Yamac C, Cangul IN. Sum-edge characteristic polynomials of graphs. J Taibah Univ Sci. 2019;13(1):193–200. doi: 10.1080/16583655.2018.1555989
  • Yurttas Gunes A, Togan M, Celik F, et al. Cut vertex and cut edge problem for topological graph indices. J Taibah Univ Sci. 2019;13(1):1175–1183. doi: 10.1080/16583655.2019.1695520
  • Feng L, Xu K, Das KC, et al. The number of spanning trees of a graph with given matching number. Int J Comput Math. 2016;93(6):837–843. doi: 10.1080/00207160.2015.1021341
  • Ma X, Fang X. An improved lower bound for the nullity of a graph in terms of matching number. Linear Multilinear Algebra. doi:10.1080/03081087.2019.1567672
  • Wu T, Lai H-J. On the permanental nullity and matching number of graphs. Linear Multilinear Algebra. 2018;66(3):516–524. doi: 10.1080/03081087.2017.1302403
  • Guo JM, Yan W, Neh YN. On the nullity and the matching number of unicyclic graphs. Linear Algebra Appl. 2009;431:1293–1301. doi: 10.1016/j.laa.2009.04.026
  • Abdollahi AR. Determinants of adjacency matrices of graphs. Trans Combin. 2012;1(4):9–16.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.