Article

A Parallel Algorithm for the Determination of All Cliques of a Symmetric Graph

June 2015
IETE Journal of Research 33(1):12-15

DOI:10.1080/03772063.1987.11436650

Authors:

This paper presents a very simple and efficient method for the determination of all cliques of symmetric graphs based on a divide-and-conquer strategy. The given graph is continually broken up into smaller and smaller subgraphs in such a way that the cliques can be obtained directly from these subgraphs. This method also leads itself naturally to parallel processing.

ResearchGate has not been able to resolve any citations for this publication.

GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE

Article

Jul 1975
NETWORKS

N. Deo

The Complexity of Computing

Article

Jan 1976

John Savage

Graph Theory With Application to Engineering and Computer Science

Book

Jan 1974

N. Deo

Conference Paper

Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions

January 2007 · Lecture Notes in Computer Science

Motivated by our study in [12] of the graph of some Fine-computable (hence Fine-continuous) but not locally uniformly Fine-continuous functions defined according to Brattka’s idea in [2], we have developed a general theory of the fractal defined by an infinite system of contractions. In our theory, non-compact invariant sets are admitted. We note also that some of such fractals, including the ... [Show full abstract] graph of Brattka’s function, are also characterized as graph-directed sets. Furthermore, mutual identity of graph-directed sets and Markov-self-similar sets is established.

Article

Full-text available

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges

December 2011

Let u and v be any two given nodes in a k-ary n-cube

Q^k_n

with at most

2n-2

faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually node-disjoint paths between u and v.

Article

Mutually Eccentric Vertices in Graphs.

April 2003 · Ars Combinatoria

The distance d(u,v) between a pair of vertices u and v is the length of a shortest path joining u and v. The eccentricity e(v) of vertex v is the distance to a vertex farthest from v. In a graph G, an eccentric vertex of v is a vertex farthest from v, that is, a vertex u for which d(u, v) = e(v). Given a set X of vertices in G, the vertices of X are mutually eccentric provided that for any pair ... [Show full abstract] of vertices u and v in X, u is an eccentric vertex of v and v is an eccentric vertex of u. In this paper, we discuss problems concerning sets of mutually eccentric vertices in graphs.

Article

An upper bound for the (n,5) - Cages

December 1997 · Ars Combinatoria

P. Wang

A (n,5) - cage is a minimal graph of regular degree n and girth 5. Let f(n,5) denote the number of vertices in a (n,5) - cage. The best known example of an (n,5) - cage is the Petersen graph, the (3,5) - cage. The (4,5) - cage is the Robertson graph, the (7,5) - cage is the Hoffman- Singleton graph, the (6,5) - cage was found by O'Keefe and Wong and there are three known (5,5) - cages. No other ... [Show full abstract] (n,5) - cages are known for n ≥ 8. In this paper, we will use a graph structure called remote edges and a set of mutually orthogonal Latin squares to give an upper bound of f(n,5) for n = 2k + 1.

Article

Coalition-Proof Nash Equilibria I. Concepts

February 1987 · Journal of Economic Theory

In an important class of “noncooperative” environments, it is natural to assume that players can freely discuss their strategies, but cannot make binding commitments. In such cases, any meaningful agreement between the players must be self-enforcing. Although the Nash best-response property is a necessary condition for self-enforceability, it is not sufficient—it is in general possible for ... [Show full abstract] coalitions arrange plausible, mutually beneficial deviations from Nash agreements. We provide a stronger definition of self-enforceability, and label the class of efficient self-enforcing agreements “coalition-proof.”

Chapter

Conditions of Cooperation

January 2015

Alicia Bockel

The objective of Chapter 3 is to define the type of conditions that are needed for sustainable cooperation in highly competitive sports games. Cooperation that leads to mutual advantage is more likely to endure in environments where specific criteria are met, and these are attainable within a competitive setting such as sports.

Article

Sequential diagnosability of star graphs

January 1996 · Computers & Electrical Engineering

Alireza Kavianpour

System-level diagnosis for n — star multi-computer systems is considered. In this approach, processors test each other and the test results are collected and analyzed to determine faulty processors. Three basic diagnosis strategies based on this approach are considered for use in n — star: one — t, one — tt, and seq — t. The one — t and one — tt are one-step diagnosis strategies which involve ... [Show full abstract] only one testing phase and one repair phase. The goal here is to identify and replace all faulty processors through one mutual testing phase. The other method is sequential diagnosis strategy (seq — t) which involves multiple iterations of testing and repair phases. The cost and diagnostic power of these three basic strategies for n — star is considered. In this paper some new properties of the sequential diagnosis strategy are discussed. In particular, we give a lower bound for the degree of diagnosability of the seq — t strategy in n − star multi-computer system.

Article

Good and bad objects: cardinality-based rules

February 2003

We consider the problem of ranking sets of objects, the members of which are mutually compatible. Assuming that each object is either good or bad, we axiomatically characterize three cardinality-based rules which arise naturally in this dichotomous setting. They are what we call the symmetric di.erence rule, the lexicographic good-bad rule, and the lexicographic bad-good rule. Each of these rules ... [Show full abstract] induces a unique additive separable preference relation over the set of all groups of objects.

Article

A Note on Endomorphisms and $C^*$ -Algebras of Graphs

November 2017

Philip M. Gipson

It is a well-known fact that endomorphisms of B(H) are intimately connected with families of mutually orthogonal isometries, i.e. with representations of the so-called Toeplitz

C^*

-algebras. In this paper we consider a natural generalization of this connection between the representation theory of certain

C^*

-algebras associated to graphs and endomorphisms of certain von Neumann subalgebras ... [Show full abstract] of B(H). Our primary results give criteria by which it may be determined if two representations give rise to equal or conjugate endomorphisms.

Article

A Study of moving Selection Down, and Top-Down and Bottom-Up Evaluation Strategies for Logical Queri...

June 1990

Static optimization of logical queries, substantially, is to push selection as far as possible in evaluating the relations of the queries. This paper shows that using Ullman's RGG (Rule/Goal Graph), static optimization for all the situations, non-recursive, recursive, mutually recursive, with some functions included, can be processed intuitively. several possible models of pushing selections down ... [Show full abstract] are presented. It is easy to understand and to see how, and how far the selections can be pushed down. Based on this, a recommendation about which of Top-Down and Bottom-Up evaluation strategies should be adopted is presented. This approach is better than other static optimization approach.

Article

Complementation in the lattice of equivalence relations

November 1996 · Discrete Mathematics

The aim of this paper is to study those pairs of complementary equivalence relations on a fixed set which are maximal as families of mutually complementary equivalence relations. The existence of such pairs on uncountable sets was proved by Steprāns and Watson (1995). They conjectured that such pairs do not exist in the finite and in the countable case. Here we disprove this conjecture by proving ... [Show full abstract] that they exist in huge quantity in both cases. We study in detail the case when: (a) one of the equivalence relations in the pair has precisely two equivalence classes; (b) one of the equivalence relations has at most three equivalence classes; (c) in one of the equivalence relations all but one equivalence classes are singletons. In cases (a) and (c) we describe all pairs of complementary equivalence relations having this extremal property. In the case (a) the non-extremal pairs are related to Turan graphs.

Article

Fair Mutual Exclusion on a Graph of Processes.

June 1987 · Distributed Computing

Jan L. A. van de Snepscheut

We represent a set of communicating processes by a graph. The mutual exclusion problem is solved for an arbitrary connected graph. The solution is shown to be fair.

Last Updated: 06 Feb 2025