A study on the pendant number of graph products (Q2283724): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127345435, #quickstatements; #temporary_batch_1722794872778 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2478/ausi-2019-0002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2969933934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5311854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A study on the pendant number of graph products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topological integer additive set-sequential graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum of all distances in composite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some graphs determined by their spectra / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127345435 / rank | |||
Normal rank |
Latest revision as of 19:08, 4 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A study on the pendant number of graph products |
scientific article |
Statements
A study on the pendant number of graph products (English)
0 references
13 January 2020
0 references
graph operations
0 references
path decomposition
0 references
pendant number
0 references