scroll to top
0

Mobile Menu

Header Layout

EBSCO Auth Banner

Let's find your institution. Click here.

Page title

Advanced Search Results For "CHARTS, diagrams, etc."

1 - 10 of 580,553 results for
 "CHARTS, diagrams, etc."
Results per page:

Enumeration for FO Queries over Nowhere Dense Graphs.

Publication Type:Academic Journal

Source(s):Journal of the ACM. May2022, Vol. 69 Issue 3, p1-37. 37p.

Abstract:We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nešetřil and Ossona de Mendez as a formalization of classes of "sparse" graphs and generalizes man...

View details

Irreversible k-Threshold Conversion Number of Circulant Graphs.

Publication Type:Academic Journal

Source(s):Journal of Applied Mathematics. 8/11/2022, p1-14. 14p.

Abstract:An irreversible conversion process is a dynamic process on a graph where a one-way change of state (from state 0 to state 1) is applied on the vertices if they satisfy a conversion rule that is determined at the beginning of the study. The irreversible...

View details

THE NON-ISOLATED RESOLVING NUMBER OF A GRAPH CARTESIAN PRODUCT WITH A COMPLETE GRAPH.

Publication Type:Academic Journal

Source(s):Acta Mathematica Universitatis Comenianae. 2022, Vol. 91 Issue 3, p191-204. 14p.

Abstract:A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. A resolving set W of G is called a non-isolated resolving set if the induced subgraph of G by W does not contain an isol...

View details

Supercliques in a Graph.

Publication Type:Academic Journal

Source(s):European Journal of Pure & Applied Mathematics. Jul2022, Vol. 15 Issue 3, p1217-1228. 12p.

Abstract:A set S ⊆ V (G) of a (simple) undirected graph G is a superclique in G if it is a clique and for every pair of distinct vertices v, w ∈ S, there exists u ∈ V (G) \ S such that u ∈ NG(v) \ NG(w) or u ∈ NG(w) \ NG(v). The maximum cardinality among the su...

View details

On the Cospectrality of Hermitian Adjacency Matrices of Mixed Graphs.

Publication Type:Academic Journal

Source(s):European Journal of Pure & Applied Mathematics. Jul2022, Vol. 15 Issue 3, p1090-1097. 8p.

Abstract:A mixed graph D is a graph that can be obtained from a graph by orienting some of its edges. Let α be a primitive nth root of unity, then the α−Hermitian adjacency matrix of a mixed graph is defined to be the matrix Hα = [hrs] where hrs = α if rs is an...

View details

INVERSE PROBLEM FOR ALBERTSON IRREGULARITY INDEX.

Publication Type:Academic Journal

Source(s):TWMS Journal of Applied & Engineering Mathematics. 2022, Vol. 12 Issue 3, p808-815. 8p.

Abstract:Graph indices have attracted great interest as they give us numerical clues for several properties of molecules. Some indices give valuable information on the molecules under consideration using mathematical calculations only. For these reasons, the ca...

View details

TOTAL ROMAN {2}-DOMINATING FUNCTIONS IN GRAPHS.

Publication Type:Academic Journal

Source(s):Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 3, p937-958. 22p.

Abstract:A Roman {2}-dominating function (R2F) is a function f: V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1. A total Roman {2}-domi...

View details

SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF VERTICES.

Publication Type:Academic Journal

Source(s):Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 3, p905-920. 16p.

Abstract:A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G),E(G)) if G-S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (...

View details

MINIMALLY STRONG SUBGRAPH (k, ℓ)-ARC-CONNECTED DIGRAPHS.

Publication Type:Academic Journal

Source(s):Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 3, p759-770. 12p.

Abstract:Let D = (V,A) be a digraph of order n, S a subset of V of size k and 2 ≤ k ≤ n. A subdigraph H of D is called an S-strong subgraph if H is strong and S ⊆ V (H). Two S-strong subgraphs D1 and D2 are said to be arc-disjoint if A(D1) ∩ A(D2) = ∅. Let λS(D...

View details

CYCLIC PERMUTATIONS IN DETERMINING CROSSING NUMBERS.

Publication Type:Academic Journal

Source(s):Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 4, p1163-1183. 21p.

Abstract:The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied. In the paper, we extend know results concerning crossing numb...

View details

banner_970x250 (970x250)

sponsored