2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188549%22&qt=morelikethis&rows=5
2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188549%22&qt=morelikethis&rows=5
2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T10:48:07-05:00 DEBUG: Deserialized SOLR response
On the edge-Wiener index of the disjunctive product of simple graphs
The edge-Wiener index of a simple connected graph G is defined as the sum of distances between all pairs of edges of G where the distance between two edges in G is the distance between the corresponding vertices in the line graph of G. In this paper, we study the edge-Wiener index under the disjunct...
Saved in:
Main Authors: | Azari, M., Iranmanesh, A. |
---|---|
Format: | Article |
Language: | English |
Published: |
Інститут прикладної математики і механіки НАН України
2020
|
Series: | Algebra and Discrete Mathematics |
Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/188549 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188549%22&qt=morelikethis
2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188549%22&qt=morelikethis
2025-02-23T10:48:07-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T10:48:07-05:00 DEBUG: Deserialized SOLR response
Similar Items
-
Construction of the maximal simple path of a graph
by: V. V. Cherniakhivskyi
Published: (2016) -
In the footsteps of Einstein and Wiener
by: E. Ashursky
Published: (2021) -
The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A. P., et al.
Published: (2018) -
The upper edge-to-vertex detour number of a graph
by: A. P. Santhakumaran, et al.
Published: (2012) -
The upper edge-to-vertex detour number of a graph
by: Santhakumaran, A.P., et al.
Published: (2012)