EuDML | Browse

Items

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 5 Next

Displaying 81 – 100 of 215

Graph compositions. I: Basic enumeration.

Knopfmacher, A., Mays, M.E. (2001)

Integers

Graph connectivity and Wiener index

I. Gutman, S. Zhang (2006)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Graph cycles and diagram commutativity

Paul C. Kainen (2012)

Diagrammes

Graph domination in distance two

Gábor Bacsó, Attila Tálos, Zsolt Tuza (2005)

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph, and k ≥ 1 an integer. A subgraph D is said to be k-dominating in G if every vertex of G-D is at distance at most k from some vertex of D. For a given class of graphs, Domₖ is the set of those graphs G in which every connected induced subgraph H has some k-dominating induced subgraph D ∈ which is also connected. In our notation, Dom coincides with Dom₁. In this paper we prove that $D o m D o m_{u} = D o m ₂_{u}$ holds for $_{u}$ = all connected graphs without induced $P_{u}$ (u ≥ 2). (In particular, ₂ = K₁ and...

Graph drawing by high-dimensional embedding.

Harel, David, Koren, Yehuda (2004)

Journal of Graph Algorithms and Applications

Graph equations for line graphs and n-th distance graphs.

Simic, Slobodan K. (1983)

Publications de l'Institut Mathématique. Nouvelle Série

Graph Equations For Line Graphs And The N-Th Power Graphs I

Jin Akiyama, Kimiko Kaneko, Slobodan Simić (1978)

Publications de l'Institut Mathématique

Graph equations, graph inequalities and a fixed point theorem.

I.B. Lackovic, D.M. Cvetkovic (1976)

Publications de l'Institut Mathématique [Elektronische Ressource]

Graph factorization, general triple systems, and cyclic triple systems.

R.G. Stanton, I.P. Goulden (1981)

Aequationes mathematicae

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...

Graph invariants and large cycles: a survey.

Nikoghosyan, Zh.G. (2011)

International Journal of Mathematics and Mathematical Sciences

Graph isomorphism of ordered sets

Chawewan Ratanaprasert (2002)

Mathematica Slovaca

Graph isomorphisms of partially ordered sets

Mária Tomková (1987)

Mathematica Slovaca

Graph layout aesthetics in UML diagrams: User preferences.

Purchase, Helen C., Allder, Jo-Anne, Carrington, David (2002)

Journal of Graph Algorithms and Applications

Graph minors and minimum degree.

Fijavž, Gašper, Wood, David R. (2010)

The Electronic Journal of Combinatorics [electronic only]

Graph Monoids.

F.W. Roush, K.H. Kim, L.G. Makar-Limanov (1982)

Semigroup forum

Graph operations and neighbor-integrity

Alpay Kırlangıc (2004)

Mathematica Bohemica

Let $G$ be a graph. A vertex subversion strategy of $G$ , say $S$ , is a set of vertices in $G$ whose closed neighborhood is removed from $G$ . The survival-subgraph is denoted by $G / S$ . The Neighbor-Integrity of $G$ , $N I (G)$ , is defined to be $N I (G) = {min}_{S \subseteq V (G)} {| S | + c (G / S)}$ , where $S$ is any vertex subversion strategy of $G$ , and $c (G / S)$ is the maximum order of the components of $G / S$ . In this paper we give some results connecting the neighbor-integrity and binary graph operations.

Currently displaying 81 – 100 of 215