The paper presents some results on graphs that do not have two distinct isomorphic spanning trees. It is proved that any such connected graph with at least two vertices must have the property that each end-block has just one edge. On the other hand, the class of such graphs is quite larg...
摘要: CiteSeerX - Scientific documents that cite the following paper: Almost all trees are cospectral, New Directions in the Theory of Graphs会议时间: 1973 收藏 引用 批量引用 报错 分享 全部来源 求助全文 citeseer.uark.edu:8080 相似文献
The following sections are included:IntroductionClassification of graphs satisfying (CT)Graphs in$\\mathcal {CT}$Graphs containing exactly one pure cycleThe main resultsFurther resultsExercise 9#Introduction#Classification of graphs satisfying (CT)#Graphs in$\\mathcal {CT}$#Graphs containing exactly ...
Tree structures are used. extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One impor... Chi,Yun,Xia,... - 《IEEE Transactions on Knowledge & Data Engineering》 被引量: 232发表: 2005年 The Steiner tree problem on graphs:...
Adversarial Examples Are Not Bugs, They Are Features On Variational Bounds of Mutual Information How Does Batch Normalization Help Optimization? Solving NP-Hard Problems on Graphs by Reinforcement Learning without Domain Knowledge Object Discovery with a Copy-Pasting GAN Towards Neural Decompilation Multi-...
Graph Generation with K 2 -trees They propose a new graph generative model based on the K 2 -tree, which is a compact and hierarchical representation for graphs. Details Abstract Graph generative models, graph neural networks 4327,Graph Generation with K 2 -trees,"We propose a new graph ge...
from the file size from the general to t from the graphs from the innovation i from the latest hit from the lesser plint from the memories from the movie red so from the nutrition pe from the public level from the resultant pi from the results wind from the small from the standpoint o...
al (2017), used an adjustment to Hovey’s test to show that alltrees are 6-cordial. It is shown here that all trees are 7-cordial bythat same adjustment.2010 Mathematics Subject Classif i cation: 05C78Keywords: graph labeling, cordial, k-cordial1. IntroductionAll graphs will be f i ...
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee tha... R Mihaescu,L Dan,L Pachter - 《Algorithmica》 被引量: 165发表: 2006年 Geodesic distance im planar graphs We derive the exact generatin...
Also, the start of 'Flora Neotropica' in 1967 helped spur an increase in collections and the discovery of new species in Brazilian Amazonia, as was the case with the mon- ographs of Chrysobalanaceae and Lecythidaceae by Prance6. In our dataset the total number of tree collections for ...