A. A. Diwan and N. P. Tholiya, Non-separating trees in connected graphs, Discrete Math.309 (2009) 5235–5237. S. Fujita and K. KawarabayashiConnectivity keeping edges in graphs with large minimum ...
This repository provides simple code snippets and implementations in Rust programming language for understanding various topics in discrete mathematics. The code examples and explanations are designed ...
ABSTRACT: In this paper, sharp upper bounds for the domination number, total domination number and connected domination number for the Cayley graph G = Cay(D2n, Ω) constructed on the finite dihedral ...
ABSTRACT: The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper we show the expression of the nullity and nullity set of unicyclic graphs with n vertices and ...
Department of Mathematics, Zhejiang Normal University, Zhejiang 321004, P. R. China Department of Basics, Zhejiang Guangsha Vocational and Technical, University of Construction, Zhejiang 322100, P. R.
Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results