Results 91 to 100 of about 453 (193)
Symmetry properties of chordal rings of degree 3
, 2003 This paper presents the main properties of chordal rings of degree 3. This family of graphs is strongly related to circulant graphs, which are actually often called chordal rings too. The use of triangles in the plane to represent the vertices allows one
Lali Barriere, Barrière, Lali
core +1 more source
Application of Music Data Visualization Technology in Music Appreciation Teaching
Engineering Reports, Volume 8, Issue 6, June 2026.The simulation environment is used to simulate real‐world music appreciation scenarios. DL is employed to preprocess music data, extract features, and identify rhythm information, which is then associated with visual design parameters to construct a parametric model.
Xiaowei Chen
wiley +1 more source
Domination, independent domination, and duality in strongly chordal graphs
Discrete Applied Mathematics, 1984 Polynomial-time algorithms for finding minimum weight dominating sets and independent dominating sets in strongly chordal graphs are presented in this paper. The algorithms are based on linear programming formulations of the problems and consist of two stages: in the first - a greedy algorithm is used to solve the corresponding dual program, and in the
openaire +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
An Examination of Task‐Evoked fMRI Data Processing in Functional Connectivity
Journal of Neuroscience Research, Volume 104, Issue 6, June 2026.In this work, we analyzed the preprocessing of task‐fMRI data to explore the contribution of the task information in connectomics towards a methodological consensus for preprocessing among task‐state connectivity studies. We investigated whether a task‐free connectivity can be inferred from task‐fMRI and examined its impact upon a clinical disorder ...
Alice Giubergia +8 more
wiley +1 more source
Algorithms for the rainbow vertex coloring problem on graph classes
, 2020 Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices.
Lima, Paloma T. +6 more
core +1 more source
The feasibility principle in community ecology
Oikos, Volume 2026, Issue 6, June 2026.The structure and function of ecological communities emerge from interactions among populations within specific environmental contexts. Yet we still lack general principles that explain how communities assemble, which patterns we should expect, and when transitions occur across diverse settings.
Serguei Saavedra
wiley +1 more source
Transient Porosity During Fluid‐Mineral Interaction. Part 1: In Situ 4D Tomography
Journal of Geophysical Research: Solid Earth, Volume 131, Issue 6, June 2026.Abstract Fluid‐induced mineral replacement reactions play a key role in controlling porosity generation and permeability evolution in geologic systems. However, the dynamic feedback between pore structure development and fluid transport remains poorly quantified. This study investigates the spatiotemporal evolution of reaction‐induced pore space in the
Hamed Amiri +7 more
wiley +1 more source
Acta Physiologica, Volume 242, Issue 6, June 2026.ABSTRACT Aims The mechanism of isosmotic water reabsorption in the kidney proximal tubule, with a focus on the interaction between the lateral Na+/K+‐ATPase, apical water pathways mediated by AQP1 and SGLT1, and paracellular water flow through Claudin‐2. Methods A mathematical model of proximal tubular transport was used to compute coupled ion, solute,
Erik Hviid Larsen +1 more
wiley +1 more source
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
, 1996 Suppose G = (V, E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 ⩽ ri ⩽ ¦Ci¦. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ¦D ∩ Ci¦ ⩾ ri for every ...
Maw-Shang, Chang +3 more
core +1 more source