on the new extension of distance-balanced graphs

Clicks: 64
ID: 194124
2016
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #8 of 8 articles by views in simulation

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
‎In this paper‎, ‎we initially introduce the concept of n n-distance-balanced property which is considered as the generalized concept of distance-balanced property‎. ‎In our consideration‎, ‎we also define the new concept locally regularity in order to find a connection between n n-distance-balanced graphs and their lexicographic product‎. ‎Furthermore‎, ‎we include a characteristic method which is practicable and can be used to classify all graphs with i i-distance-balanced properties for i=2,3 i=2,3 which is also relevant to the concept of total distance‎. ‎Moreover‎, ‎we conclude a connection between distance-balanced and 2-distance-balanced graphs‎.
Reference Key
2016transactionson Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors
Journal simulation
Year 2016
DOI
DOI not found
URL
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.