Results 81 to 90 of about 120,514 (220)
Componentwise linearity of ideals arising from graphs
Let G be a simple undirected graph on n vertices.
Veronica Crispin, Eric Emtander
doaj
ABSTRACT Is musical analysis meant to guide performance – or to be based on it? Can a Schenkerian analysis of a piece be corroborated by a performance or an arrangement? This article addresses these questions through a well‐known test case – the first prelude of the first book of Bach's Well‐Tempered Clavier, as analysed by Heinrich Schenker in Five ...
NAPHTALI WAGNER, RAM REUVEN
wiley +1 more source
New graph classes characterized by weak vertex separators and two-pairs
A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj +1 more source
Well-partitioned chordal graphs: obstruction set and disjoint paths [PDF]
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star structure, the leaves of which are of size one.
arxiv
Forbidden subgraphs of TI-power graphs of finite groups
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj +1 more source
Component graphs of vector spaces and zero-divisor graphs of ordered sets
In this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar+2 more
doaj +1 more source
Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]
Given a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
doaj +1 more source
Graph Isomorphism by Conversion to Chordal (6, 3) Graphs [PDF]
Babel has shown that for an extended class of chordal (6, 3) graphs the coarsest regular simplicial partition is equivalent to the graph's automorphism partition. We give a reversible transformation for any graph to one of these graph by using Booth's reduction of a graph to a chordal graph and elimination of Babel's forbidden subgraphs for these ...
arxiv
Mining an Anthropocene in Japan: On the making and work of geological imaginaries
Short Abstract This article addresses how the lithic and the drift might be reworked as an Anthropocene material outside of a chronostratigraphy. Revisiting the finding of a floating fern fossil at the Hashima mine, we delve into a complex array of Geological imaginaries, and undertake our own speculative work.
Deborah P. Dixon+2 more
wiley +1 more source
The current study improves cyber toxicology as a method of evaluating environmental toxicity and molecular biological qualities in addition to clarifying the possible molecular pathways of nicotine‐induced senescence in IVDD. ABSTRACT Aim Through the use of network toxicology, the research sought to determine whether cellular senescence and associated ...
Chen Jiang+8 more
wiley +1 more source