A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4280651112 / rank | |||
Normal rank | |||
Revision as of 23:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks |
scientific article |
Statements
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (English)
0 references
13 June 2022
0 references
the number of spanning connected unicyclic(bicyclic) subgraphs
0 references
2-separable network
0 references
fractal scale-free network
0 references
entropy
0 references
