Results 221 to 230 of about 107,276 (264)
Some of the next articles are maybe not open access.
Uniquely Tree-saturated Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berman, Leah Wrenn +4 more
openaire +1 more source
Indistinguishable Trees and Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wagner, Stephan G., Wang, Hua
openaire +2 more sources
IEEE Transactions on Circuits and Systems, 1975
The concept of the tree graph of a given connected graph was first introduced and studied by Cummins [2]. Further properties of tree graphs were explored in [1], [6]-[10]. In this correspondence, some additional properties of tree graphs are brought out. A related concept of tree numbers is introduced and explored.
M. Krishnamoorthy, N. Deo
openaire +1 more source
The concept of the tree graph of a given connected graph was first introduced and studied by Cummins [2]. Further properties of tree graphs were explored in [1], [6]-[10]. In this correspondence, some additional properties of tree graphs are brought out. A related concept of tree numbers is introduced and explored.
M. Krishnamoorthy, N. Deo
openaire +1 more source
Trees and Tree-Equivalent Graphs
Canadian Journal of Mathematics, 1965As is well known in the theory of graphs a tree is a connected graph without cycles. Many characterizing properties of trees are known (1), for example the cyclomatic number is equal to zero, which is also equal to p — 1, where p is the number of connected components of the graph.
openaire +2 more sources
Canadian Journal of Mathematics, 1966
A graph is said to be d-polyhedral provided it is isomorphic with the graph formed by the vertices and edges of a d-dimensional bounded (convex) polyhedron (d-polyhedron). A k-tree is a connected acyclic graph in which each vertex is of valence ⩽k.
openaire +1 more source
A graph is said to be d-polyhedral provided it is isomorphic with the graph formed by the vertices and edges of a d-dimensional bounded (convex) polyhedron (d-polyhedron). A k-tree is a connected acyclic graph in which each vertex is of valence ⩽k.
openaire +1 more source
Convergecast Tree on Temporal Graphs
International Journal of Foundations of Computer Science, 2020Temporal graphs are useful tools to model dynamic network topologies found in many applications. In this paper, we address the problem of constructing a convergecast tree on temporal graphs for data collection in dynamic sensor networks. Two types of convergecast trees, bounded arrival time convergecast tree and minimum total arrival time convergecast
Subhrangsu Mandal, Arobinda Gupta
openaire +2 more sources
1994
Abstract The theory of graphs impinges on the study of knots and surfaces in four significant ways. We shall see how knots can be studied by graph theory applied to their diagrams, and how graphs can be studied by embedding them in surfaces.
N D Gilbert, T Porter
openaire +1 more source
Abstract The theory of graphs impinges on the study of knots and surfaces in four significant ways. We shall see how knots can be studied by graph theory applied to their diagrams, and how graphs can be studied by embedding them in surfaces.
N D Gilbert, T Porter
openaire +1 more source