Results 71 to 80 of about 1,362 (112)
A formula for all minors of the adjacency matrix and an application
Special Matrices, 2014 We supply a combinatorial description of any minor of the adjacency matrix of a graph. This descriptionis then used to give a formula for the determinant and inverse of the adjacency matrix, A(G), of agraph G, whenever A(G) is invertible, where G is ...
Bapat R. B., Lal A. K., Pati S.
doaj +1 more source
A partition of connected graphs
, 2005 We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R.
Wiseman, Gus
core +2 more sources
On the Minimum Number of Spanning Trees in Cubic Multigraphs
Discussiones Mathematicae Graph Theory, 2020 Let G2n, H2n be two non-isomorphic connected cubic multigraphs of order 2n with parallel edges permitted but without loops. Let t(G2n), t (H2n) denote the number of spanning trees in G2n, H2n, respectively. We prove that for n ≥ 3 there is the unique G2n
Bogdanowicz Zbigniew R.
doaj +1 more source
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones Mathematicae Graph Theory, 2016 We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source
Exact solutions and bounds for network SIR and SEIR models using a rooted-tree approximation. [PDF]
J Math Biol, 2023 Hall CL, Siebert BA.
europepmc +1 more source
Couplings of Uniform Spanniing Forests
, 2003 We prove the existence of an automorphism-invariant coupling for the wired and the free uniform spanning forests on Cayley graphs of finitely generated residually amenable groups.Comment: 7 ...
Bowen, Lewis
core
On Accurate Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna +2 more
doaj +1 more source
The expected loss of feature diversity (versus phylogenetic diversity) following rapid extinction at the present. [PDF]
J Math Biol, 2023 Overwater M, Pelletier D, Steel M.
europepmc +1 more source
On Two Generalized Connectivities of Graphs
Discussiones Mathematicae Graph Theory, 2018 The concept of generalized k-connectivity κk(G), mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity.
Sun Yuefang, Li Fengwei, Jin Zemin
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V, E), a function f : V (G) → {1, 2, . . ., k} is a kranking for G if f(u) = f(v) implies that every u − v path contains a vertex w such that f(w) > f(u).
Pillone D.
doaj +1 more source