Symmetries of Graphs and Networks

نویسنده

  • Carmen Amarra
چکیده

Symmetric graphs of diameter 2 with complete normal quotients Carmen Amarra University of Western Australia, Australia [email protected] A graph has diameter 2 if it is not a complete graph and if every pair of nonadjacent vertices is joined by a path of length 2. Our general problem is to examine the overall structure of graphs which are both arc-transitive and of diameter 2 using normal quotients. We identify the basic graphs in the class of arc-transitive diameter 2 graphs to be those Γ which satisfy one of the following (relative to some group G of automorphisms of Γ): (i) Γ does not have a nontrivial G -normal quotient, or (ii) all nontrivial G -normal quotients of Γ are complete graphs. In this talk we discuss basic graphs which are of type (ii), in particular the case where there are at least 3 nontrivial normal quotients. For this case we can identify all the graphs that arise, using the classification of the transitive finite linear groups. Leonard triples associated with hypercubes and their antipodal quotients George Brown University of Wisconsin Madison, USA [email protected] LetA be the unital associative algebra over C with generators x , y , z and relations x y + y x = 2z , y z + z y = 2x and z x + x z = 2y . We find the finite-dimensional irreducible A modules and show that x , y , z act on these modules as bipartite or almost bipartite Leonard triples. We define an operator s on finite-dimensional sl2-modules that gives them anA structure. Let d denote a nonnegative integer and let Qd denote the graph of the d -dimensional hypercube. It is known that the Terwilliger algebra of Qd has an sl2-module structure. When d is even, we show that applying s to the Terwilliger algebra of Qd produces the Terwilliger algebra of the alternate Q-polynomial structure of Qd . When d is odd, we show that applying s to the Terwilliger algebra of Qd produces the Terwilliger algebra of the antipodal quotient of Qd .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hidden Symmetries in Real and Theoretical Networks

Symmetries are ubiquitous in real networks and often characterize network features and functions. Here we present a generalization of network symmetry called latent symmetry, which is an extension of the standard notion of symmetry. They are defined in terms of standard symmetries in a reduced version of the network. One unique aspect of latent symmetries is that each one is associated with a s...

متن کامل

Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs

Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...

متن کامل

Toughness of the Networks with Maximum Connectivity

The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

متن کامل

finding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory

In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...

متن کامل

Edge-tenacity in Networks

Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

متن کامل

Incidence cuts and connectivity in fuzzy incidence graphs

Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010