Character polynomials, their -analogs and the Kronecker product.
Character sums and Ramsey properties of generalized Paley graphs.
Character theory of symmetric groups, analysis of long relators, and random walks.
Characterisation of some sparse binary sequential arrays.
Characterisation of Some Steiner Systems, Parallelisms, and Biplanes.
Characterising subspaces of Banach spaces with a Schauder basis having the shift property
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.
Characteristic points of recursive systems.
Characteristic polynomials of some weighted graph bundles and its application to links.
Characteristics And Maching Polynomials Of Some Compound Graphs
Characterization by intersection graph of some families of finite nonsimple groups
For a finite group , , the intersection graph of , is a simple graph whose vertices are all nontrivial proper subgroups of and two distinct vertices and are adjacent when . 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 -bar visibility trees.
Characterization of -minimally nonouterplanar join graphs
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 -consistent.
Characterization of block graphs with equal 2-domination number and domination number plus one
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
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.
Characterization of Line-Consistent Signed Graphs
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
Characterization of -vertex graphs with metric dimension
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the metric representation of with respect to , where is the distance between vertices and . A set is called a resolving set for if distinct vertices of have distinct representations with respect to . The minimum cardinality of a resolving set for is its metric dimension. In this paper, we characterize all graphs of order with metric dimension .