×

On numerical invariant of graph. (English) Zbl 1499.05426

MSC:

05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Harary, Frank, Graph theory. Addision-wesley publishing company (1969) · Zbl 0182.57702
[2] Slepian, P., Mathematical Foundations of Network Analysis. Springer Tracts in Natural Philosophy, 16, Boundary Operator and Coboundary Operator (1968), Springer, Berlin, Heidelberg · Zbl 0167.52302 · doi:10.1007/978-3-642-87424-6a
[3] Nerode, A.; Shank, H., An Algebraic Proof of Kirchhoffs Network Theorem, American Math. Monthly, 68, 3 (1961) · Zbl 0102.33902 · doi:10.2307/2311455
[4] https://en.wikipedia.org/wiki/Category:Graphinvariants
[5] Biggs, N., Algebraic graph theory (1993), Cambridge: Cambridge University Press, Cambridge
[6] Bondy, J. A., Graduate texts in mathematics, 244, USR. Murty, Graph theory (2008), London: Springer, London · Zbl 1134.05001
[7] Kim, Younng-Jin; Kook, Woong, Harmonic cycles for graphs, Linear and Multilinear Algebra, 67, 5, 965-975 (2019) · Zbl 1411.05168 · doi:10.1080/03081087.2018.1440519
[8] Veblen, Oswald, Analysis Situs, Part-II, American Mathematical Society Colloquium Lectures, 5 (1916), New York: American Mathematical Society, New York · JFM 48.0647.10
[9] Guy, R. K., A combinatorial problem, Nabla (Bull.Malayan Math. Soc.), 7 (1960)
[10] Guy, R. K.; Alavi, Y.; Lick, D. R.; White, A. T., Crossing numbers of graphs. Graph Theory and Applications, Lecture Notes in Mathematics, 303 (1972), Springer, Berlin, Heidelberg · doi:10.1007/BFb0067363
[11] Kleitman, D.J., The crossing number of K_5,n, J. Combin. Theory, Vol. 9, pp. 315-323, (1970). · Zbl 0205.54401
[12] Pan, S.; Richter, R. B., The crossing number of K_11 is 100, J. Graph Theory, 56, 128-134 (2007) · Zbl 1128.05018 · doi:10.1002/jgt.20249
[13] McQuillan, Dan; Pan, Shengjun; Richter, Bruce, On the crossing number of K_13, Journal of Combinatorial Theory, Series B, 115, 224-235 (2015) · Zbl 1319.05045 · doi:10.1016/jjctb.2015.06.002
[14] Woodall, D. R., Cyclicorder graphs and Zarankiewicz’s crossingnumber conjecture, J. Graph Theory, 17, 657-671 (1993) · Zbl 0792.05142 · doi:10.1002/jgt.3190170602
[15] McQuillan, Dan; Bruce Richter, R., On the Crossing Number of without Computer Assistance, Journal of Graph Theory, 82, -, 387-432 (2015) · Zbl 1342.05091 · doi:10.1002/jgt.21908
[16] Szkely, Lszl A., Turns Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, Graph Theory, -, 211-230 (2016) · Zbl 1352.05060 · doi:10.1007/978-3-319-31940-7-13
[17] Balogh, Jzsef; Lidick, Bernard; Salazar, Gelasio, Closing in on Hill’s Conjecture, SIAM Journal on Discrete Mathematics, 33, -, 1261-1276 (2019) · Zbl 1419.05050 · doi:10.1137/17M1158859
[18] Biedl, Therese; Chimani, Markus; Derka, Martin; Mutzel, Petra, Crossing Number for Graphs with Bounded Pathwidth, Algorithmica (2020) · Zbl 1433.68280 · doi:10.1007/s00453-019-00653-x
[19] Huang, Yuanqiu; Wang, Yuxi, The crossing number of, Applied Mathematics and Computation, 376, 125075 (2020) · Zbl 1475.05123 · doi:10.1016/j.amc.2020.125075
[20] O’neill, Barrett (1983), Semi-Riemannian Geometry with Applications to Relativity, Academic Press · Zbl 0531.53051
[21] Gans, David; Dynamics, Structural, Journal of Dynamical Systems, 3, 2, 43-55 (2010)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.