Average Distance and Independence Number
نویسنده
چکیده
A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.
منابع مشابه
Girth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملSpanning Trees with Many Leaves and Average Distance
In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...
متن کاملOn AGX Conjectures Regarding Average Eccentricity
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. In this paper we resolve five conjectures, obtained by the system AutoGraphiX, about the average eccentricity and other graph parameters (independence number, chromatic number and the Randić index), and refute t...
متن کاملe-Learning Theories with Emphasis on Independence Theory
Introduction: The basis of distance learning rests on the independence of the learner. The independent learning-teaching process is an educational system in which each learner is independent and separated from their teacher by time and place. Hence the present study seeks to examine E-learning Theories in general, but focuses on Independence Theory. Methods: The present study was conducte...
متن کاملUsing minimum degree to bound average distance
Total and average distance are not only interesting invariants of graphs in their own right but are also used for studying properties or classifying graphical systems that depend on the number of edges traversed. Recent examples include studies of computer networks [3] and the use of graphical invariants to partially classify the structure of molecules [1]. There have been a number of conjectur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 51 شماره
صفحات -
تاریخ انتشار 1994