On self-centeredness of product of graphs (Q2402949): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59124222 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2016/2508156 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2476658218 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4294577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs containing a given graph as center / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On special classes of self-centred graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3070292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some notes on minimal self-centered graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3005852 / rank | |||
Normal rank |
Latest revision as of 09:24, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On self-centeredness of product of graphs |
scientific article |
Statements
On self-centeredness of product of graphs (English)
0 references
15 September 2017
0 references
Summary: A graph \(G\) is said to be a self-centered graph if the eccentricity of every vertex of the graph is the same. In other words, a graph is a self-centered graph if radius and diameter of the graph are equal. In this paper, self-centeredness of strong product, co-normal product, and lexicographic product of graphs is studied in detail. The necessary and sufficient conditions for these products of graphs to be a self-centered graph are also discussed. The distance between any two vertices in the co-normal product of a finite number of graphs is also computed analytically.
0 references
self-centeredness of strong product of graphs
0 references
self-centeredness of co-normal product of graphs
0 references
lexicographic product of graphs
0 references