From paths to stars
The number of cycles in the complement T′ of a tree T is known to increase with the diameter of the tree. A similar question is raised and settled for the number of complete subgraphs in T′ for a special class of trees via Fibonacci numbers. A structural characterization of extremal trees is also pr...
Saved in:
Main Author: | A. F. Alameddine |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1991-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171291000418 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison
by: Bismita S. Jena, et al.
Published: (2019-09-01) -
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
by: E. J. Farrell
Published: (1983-01-01) -
Hypergraph-Based Organizers’ Behavior Scheduling Optimization: High-Order Relationships Discovery
by: Ziqi Xu, et al.
Published: (2025-01-01) -
Distance and degree based topological characterization, spectral and energetic properties, and 13C NMR signals of holey nanographene
by: Savari Prabhu, et al.
Published: (2025-04-01) -
Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs
by: T. V. Lubasheva
Published: (2018-12-01)