Add to ORKG博多ワークショップ「組み合わせとその応用」Hakata workshop, combinatrics and its applications第2部 数学ソフトウェア紹
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
Abstract. We introduce ‘fundamental problems ” in ‘conlputational algebraic analysis ” and explain t...
We present a new algebraic formulation for computing edge connectivities in a directed graph, using ...
AbstractLet Cn,g be the lollipop graph obtained by appending a g-cycle Cg to a pendant vertex of a p...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
AbstractSuppose that G is an undirected graph, and that H is a spanning subgraph of Gc whose edges i...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic ...
AbstractLet G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed ...
AbstractThis paper introduces the connection-graph-stability method and uses it to establish a new l...
Firstly, we shall start with an introduction to the main topics in Graph Theory with special emphasi...
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G b...
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G b...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
The second smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connecti...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
Abstract. We introduce ‘fundamental problems ” in ‘conlputational algebraic analysis ” and explain t...
We present a new algebraic formulation for computing edge connectivities in a directed graph, using ...
AbstractLet Cn,g be the lollipop graph obtained by appending a g-cycle Cg to a pendant vertex of a p...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
AbstractSuppose that G is an undirected graph, and that H is a spanning subgraph of Gc whose edges i...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic ...
AbstractLet G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed ...
AbstractThis paper introduces the connection-graph-stability method and uses it to establish a new l...
Firstly, we shall start with an introduction to the main topics in Graph Theory with special emphasi...
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G b...
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G b...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
The second smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connecti...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
Abstract. We introduce ‘fundamental problems ” in ‘conlputational algebraic analysis ” and explain t...
We present a new algebraic formulation for computing edge connectivities in a directed graph, using ...