All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 162

Showing per page

Boolean matrices ... neither Boolean nor matrices

Gabriele Ricci (2000)

Discussiones Mathematicae - General Algebra and Applications

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.

Bootstrap clustering for graph partitioning

Philippe Gambette, Alain Guénoche (2011)

RAIRO - Operations Research - Recherche Opérationnelle

Given a simple undirected weighted or unweighted graph, we try to cluster the vertex set into communities and also to quantify the robustness of these clusters. For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to the initial one, (iii) applying the clustering method to each of them, making a profile (set) of partitions, (iv) computing a consensus partition for this profile,...

Bootstrap clustering for graph partitioning∗

Philippe Gambette, Alain Guénoche (2012)

RAIRO - Operations Research

Given a simple undirected weighted or unweighted graph, we try to cluster the vertex set into communities and also to quantify the robustness of these clusters. For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to the initial one, (iii) applying the clustering method to each of them, making a profile (set) of partitions, (iv) computing a consensus partition for this profile,...

Borsuk-Ulam type theorems

Adam Idzik (1995)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

A generalization of the theorem of Bajmóczy and Bárány which in turn is a common generalization of Borsuk's and Radon's theorem is presented. A related conjecture is formulated.

Bottom Schur functions.

Clifford, Peter, Stanley, Richard P. (2004)

The Electronic Journal of Combinatorics [electronic only]

Boundary of the union of rectangles in the plane

Václav Medek (1983)

Aplikace matematiky

Given n rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.

Bounded expansion in web graphs

Silvia Gago, Dirk Schlatter (2009)

Commentationes Mathematicae Universitatis Carolinae

In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.

Bounding neighbor-connectivity of Abelian Cayley graphs

Lynne L. Doty (2011)

Discussiones Mathematicae Graph Theory

For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is bounded above by κ. Doty has sharpened that bound in abelian Cayley graphs to approximately (1/2)κ. The...

Bounds concerning the alliance number

Grady Bullington, Linda Eroh, Steven J. Winters (2009)

Mathematica Bohemica

P. Kristiansen, S. M. Hedetniemi, and S. T. Hedetniemi, in Alliances in graphs, J. Combin. Math. Combin. Comput. 48 (2004), 157–177, and T. W. Haynes, S. T. Hedetniemi, and M. A. Henning, in Global defensive alliances in graphs, Electron. J. Combin. 10 (2003), introduced the defensive alliance number a ( G ) , strong defensive alliance number a ^ ( G ) , and global defensive alliance number γ a ( G ) . In this paper, we consider relationships between these parameters and the domination number γ ( G ) . For any positive integers...

Currently displaying 101 – 120 of 162