Results 1 to 10 of about 107,276 (264)
Tree-Like Partial Hamming Graphs
Discussiones Mathematicae Graph Theory, 2014 Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs.
Gologranc Tanja
doaj +2 more sources
Decentralized Optimization Over Tree Graphs [PDF]
Journal of Optimization Theory and Applications, 2021 This paper presents a decentralized algorithm for non-convex optimization over tree-structured networks. We assume that each node of this network can solve small-scale optimization problems and communicate approximate value functions with its neighbors based on a novel multi-sweep communication protocol.
Yuning Jiang +4 more
openaire +4 more sources
A New Tree Graph Method for Synthesizing Planetary Gear Trains of Vehicle Powertrains
Energies, 2023 The function of vehicle powertrains is to transmit power from the power source (engine or electric machine) to the output shaft. Different torques and speeds of the output shaft are achieved through the structure of planetary gear train (PGT).
Wenjian Yang +3 more
doaj +1 more source
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +1 more source
General Atom-Bond Sum-Connectivity Index of Graphs
Mathematics, 2023 This paper is concerned with the general atom-bond sum-connectivity index ABSγ, which is a generalization of the recently proposed atom-bond sum-connectivity index, where γ is any real number.
Abeer M. Albalahi +2 more
doaj +1 more source
Ratio Mathematica, 2023 For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one.
Meena S, Gajalakshmiy G
doaj +1 more source
INDIVIDUAL TREE SEGMENTATION FROM BLS DATA BASED ON GRAPH AUTOENCODER [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2023 In the last two decades, Light detection and ranging (LiDAR) has been widely employed in forestry applications. Individual tree segmentation is essential to forest management because it is a prerequisite to tree reconstruction and biomass estimation ...
R. Fekry +3 more
doaj +1 more source
On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks
Complexity, 2021 Kragujevac tree is indicated by K; K∈Kgq=s2t+1+1,s with order and size s2t+1+1 and s2t+1, respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e ...
Salma Kanwal +6 more
doaj +1 more source
Graph Homomorphisms between Trees [PDF]
The Electronic Journal of Combinatorics, 2014 In this paper we study several problems concerning the number of homomorphisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees.
Csikvari, Peter, Lin, Zhicong
openaire +4 more sources
Tarantula graphs are determined by their Laplacian spectrum
Electronic Journal of Graph Theory and Applications, 2021 A graph G is said to be determined by its Laplacian spectrum (DLS) if every graph with the same Laplacian spectrum is isomorphic to G. A graph which is a collection of hexagons (lengths of these cycles can be different) all sharing precisely one vertex ...
Reza Sharafdini, Ali Zeydi Abdian
doaj +1 more source