Generalized T-Edge Distance-Balanced Graphs
Abstract
A connected and nonempty graph A is defined as generalized t-edge distance-balanced, while for each edge f=α\beta the number of edges nearer to α than \beta are equal to t-times of edges nearer to \beta than to α, for t ∈ N, or vice versa. We determine some classes of such graphs. Moreover, we investigate edge-szeged index of the generalized t-edge distance-balanced graphs. Also, it is discussed about their cartesian and lexicographic products.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.