Results 71 to 80 of about 1,360 (113)
Inverse Problem on the Steiner Wiener Index
Discussiones Mathematicae Graph Theory, 2018 The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source
Some remarks on the Dirichlet problem on infinite trees
Concrete Operators, 2019 We consider the Dirichlet problem on in_nite and locally _nite rooted trees, andwe prove that the set of irregular points for continuous data has zero capacity. We also give some uniqueness results for solutions in Sobolev W1,p of the tree.
Chalmoukis Nikolaos, Levi Matteo
doaj +1 more source
Complete graphs: the space of simplicial cones, and their path tree representation
, 2017 Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with the graph ...
Ron, Amos, Shengnan, Wang
core
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
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
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