EuDML | Browse

We give an intrinsic characterisation of the separable reflexive Banach spaces that embed into separable reflexive spaces with an unconditional basis all of whose normalised block sequences with the same growth rate are equivalent. This uses methods of E. Odell and T. Schlumprecht.

Characteristic for reflexive relations.

Frank D. Farmer (1977)

Aequationes mathematicae

Characteristic points of recursive systems.

Bell, Jason P., Burris, Stanley N., Yeats, Karen A. (2010)

The Electronic Journal of Combinatorics [electronic only]

Characteristic polynomials of some weighted graph bundles and its application to links.

Sohn, Moo Young, Lee, Jaeun (1994)

International Journal of Mathematics and Mathematical Sciences

Characteristics And Maching Polynomials Of Some Compound Graphs

Ivan Gutman (1980)

Publications de l'Institut Mathématique

Characterization by intersection graph of some families of finite nonsimple groups

Hossein Shahsavari, Behrooz Khosravi (2021)

Czechoslovak Mathematical Journal

For a finite group $G$ , $Γ (G)$ , the intersection graph of $G$ , is a simple graph whose vertices are all nontrivial proper subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent when $H \cap K \neq 1$ . In this paper, we classify all finite nonsimple groups whose intersection graphs have a leaf and also we discuss the characterizability of them using their intersection graphs.

Characterization of $[1, k]$ -bar visibility trees.

Chen, Guantao, Hutchinson, Joan P., Keating, Ken, Shen, Jian (2006)

The Electronic Journal of Combinatorics [electronic only]

Characterization of $2$ -minimally nonouterplanar join graphs

D. G. Akka, J. K. Bano (2001)

Mathematica Bohemica

In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.

Characterization of a signed graph whose signed line graph is $S$ -consistent.

Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Characterization of block graphs with equal 2-domination number and domination number plus one

Adriana Hansberg, Lutz Volkmann (2007)

Discussiones Mathematicae Graph Theory

Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of the graph G, if every vertex v ∈ V(G)-D is adjacent with at least p vertices of D. The p-domination number γₚ(G) is the minimum cardinality among the p-dominating sets of G. Note that the 1-domination number γ₁(G) is the usual domination number γ(G). If G is a nontrivial connected block graph, then we show that γ₂(G) ≥ γ(G)+1, and we characterize all connected block graphs with...

Characterization of Cubic Graphs G with ir t (G) = Ir t (G) = 2

Changiz Eslahchi, Shahab Haghi, Nader Jafari (2014)

Discussiones Mathematicae Graph Theory

A subset S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S −{v}. The total irredundance number, ir(G), is the minimum cardinality of a maximal total irredundant set of G, while the upper total irredundance number, IR(G), is the maximum cardinality of a such set. In this paper we characterize all cubic graphs G with irt(G) = IRt(G) = 2

Characterization of finite groups by their commuting graph.

Iranmanesh, A., Jafarzadeh, A. (2007)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Characterization of Line-Consistent Signed Graphs

Daniel C. Slilaty, Thomas Zaslavsky (2015)

Discussiones Mathematicae Graph Theory

The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a simple proof that does not depend...

Characterization of magic graphs

Samuel Jezný, Marián Trenkler (1983)

Czechoslovak Mathematical Journal

Characterization of $n$ -vertex graphs with metric dimension $n - 3$

Mohsen Jannesari, Behnaz Omoomi (2014)

Mathematica Bohemica

For an ordered set $W = {w_{1}, w_{2}, ..., w_{k}}$ of vertices and a vertex $v$ in a connected graph $G$ , the ordered $k$ -vector $r (v | W) : = (d (v, w_{1}), d (v, w_{2}), ..., d (v, w_{k}))$ is called the metric representation of $v$ with respect to $W$ , where $d (x, y)$ is the distance between vertices $x$ and $y$ . A set $W$ is called a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$ . The minimum cardinality of a resolving set for $G$ is its metric dimension. In this paper, we characterize all graphs of order $n$ with metric dimension $n - 3$ .

Currently displaying 61 – 80 of 663

Previous Page 4 Next