منابع مشابه
Antipodal Bipolar Fuzzy Graphs
The concept of an antipodal bipolar fuzzy graph of a given bipolar fuzzy graph is introduced. Characterizations of antipodal bipolar fuzzy graphs are presented when the bipolar fuzzy graph is complete or strong. Some isomorphic properties of antipodal bipolar fuzzy graph are discussed. The notion of self median bipolar fuzzy graphs of a given bipolar fuzzy graph is also introduced.
متن کاملAntipodal Embeddings of Graphs
An antipodal graph D of diameter d has the property that each vertex v has a unique (antipodal) vertex v at distance d from v in D. We show that any such D has circuits of length Id passing through antipodal pairs of vertices. The identification of antipodal vertex-pairs in D produces a quotient graph G with a double cover projection morphism p : D-+G. Using the two-fold quotient map of surface...
متن کاملAntipodal Interval-Valued Fuzzy Graphs
Concepts of graph theory have applications in many areas of computer science including data mining, image segmentation, clustering, image capturing, networks, etc . An interval-valued fuzzy set is a generalization of the notion of a fuzzy set. Interval-valued fuzzy models give more precision, flexibility and compatibility to the system as compared to the fuzzy models. In this paper, we introduc...
متن کاملRadio Antipodal Colorings of Graphs
A radio antipodal coloring of a connected graph G with diameter d is an assignment of positive integers to the vertices of G, with x ∈ V (G) assigned c(x), such that d(u, v) + |c(u) − c(v)| d for every two distinct vertices u, v of G, where d(u, v) is the distance between u and v in G. The radio antipodal coloring number ac(c) of a radio antipodal coloring c of G is the maximum color assigned t...
متن کاملAntipodal Distance Transitive Covers of Complete Graphs
This paper is a contribution towards the determination of all finite distance-transitive graphs. We obtain a classification of all the antipodal distance-transitive graphs having as antipodal quotient a complete graph Kn . Such a graph necessarily has diameter 2 or 3 (see for example [2, Proposition 4.2.2 (ii)]). Those of diameter 2 are simply the complete multipartite graphs Kr,...,r with n pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1974
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90072-0