Certain cubic multigraphs and their upper embeddability
Certain new M-matrices and their properties with applications
The Mₙ-matrix was defined by Mohan [21] who has shown a method of constructing (1,-1)-matrices and studied some of their properties. The (1,-1)-matrices were constructed and studied by Cohn [6], Ehrlich [9], Ehrlich and Zeller [10], and Wang [34]. But in this paper, while giving some resemblances of this matrix with a Hadamard matrix, and by naming it as an M-matrix, we show how to construct partially balanced incomplete block designs and some regular graphs by it. Two types of these M-matrices...
Certificates of factorisation for a class of triangle-free graphs.
Certificates of factorisation for chromatic polynomials.
Chaines maximales de préordres.
Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order.
Changing of the domination number of a graph: edge multisubdivision and edge removal
Characerization of a class of distance regular graphs.
Character sums and Ramsey properties of generalized Paley graphs.
Characteristic for reflexive relations.
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...