The maximum genus of diameter three graphs
نویسندگان
چکیده
The maximum gen'us of connected of orient able surface on which G has 2-ce11 C:U.UYC;UUULl.".. to 2,M(G) where (3(G) the Betti n'umber of G.
منابع مشابه
On reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملThe maximum genus of graphs of diameter two
Skoviera, M., The maximum genus of graphs of diameter two, Discrete Mathematics 87 (1991) 175-180. Let G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper embeddable, i.e. the maximum genus y,&G) equals [fi(G)/Z], where /3(G) = IF(G)1 IV(G)1 + 1 is the Betti number of G. For graphs with loops we show that [p(G)/21 2s yM(G) c &G)/Z] if G is vertex 2-connected, ...
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملConstructions of Large Graphs on Surfaces
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface Σ and integers ∆ and k, determine the maximum order N(∆, k,Σ) of a graph embeddable in Σ with maximum degree ∆ and diameter k. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs in the available tables of largest known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 14 شماره
صفحات -
تاریخ انتشار 1996