Results 101 to 110 of about 34,901 (303)

On star coloring of Mycielskians

Indonesian Journal of Combinatorics, 2018
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose ...
K. Kaliraj, V. Kowsalya, Vernold Vivin
doaj   +1 more source

Approximate triangle counting with vertex coloring on the UPMEM architecture [PDF]

, 2023
openA causa della necessità, negli ultimi anni, di analizzare una quantità sempre crescente di dati, le restrizioni poste dalla larghezza di banda e dalla latenza della memoria DRAM limitano la scalabilità dei sistemi computazionali e impediscono un ...
ASQUINI, LORENZO
core  

Topography‐Regulated Screening Platform for Myoblast Contact Guidance

Advanced Materials Technologies, EarlyView.
This study develops a topography‐regulated screening platform (12 gradients in 96‐topography‐well plate) enabling analysis of skeletal muscle morphogenesis. The topography‐induced cell morphology changed, cell polarization, and myotube differentiation, establishing an evaluative framework for generating pathologically relevant myotube phenotypes to ...
Tianqi Feng, Torben A.B. van der Boon, Savannah Amy Haupt, Adam Jones, Yanjing Ji, Theo G. Van Kooten, Patrick van Rijn   +6 more
wiley   +1 more source

Touching Triangle Representations for 3-Connected Planar Graphs

, 2013
A touching triangle graph (TTG) representation of a planar graph is a planar drawing Γ of the graph, where each vertex is represented as a triangle and each edge e is represented as a side contact of the triangles that correspond to the end vertices of e.
Rahnuma Islam Nishat, Stephen G. Kobourov, Debajyoti Mondal, Nishat, Rahnuma Islam, Mondal, Debajyoti, Kobourov, Stephen G.   +5 more
core   +1 more source

Formation Control of Multi‐Agent System with Local Interaction and Artificial Potential Field

Advanced Robotics Research, EarlyView.
This article proposes a local interaction‐based formation control method for Multi‐Agent system, integrating consensus and leader‐follower strategies with a stress response mechanism—artificial potential field to reduce communication overhead and enable obstacle avoidance. Experimental results on triangular, square, and hexagonal formations confirm its
Luoyin Zhao, Zheping Yan, Yuqing Wang, Raye Chen‐Hua Yeow   +3 more
wiley   +1 more source

On the Representation of a PI-Graph

Trends in Computational and Applied Mathematics, 2007
Consider two parallel lines (denoted r1 and r2). A graph is a PI graph (Point-Interval graph) if it is an intersection graph of a family F of triangles between r1 and r2 such that each triangle has an interval with two endpoints on r1 and a vertex (a ...
S.M. Almeida, C.P. de Mello, A. Gomide
doaj   +1 more source

Directed triangles in directed graphs

Discrete Mathematics, 1992
The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
Maurits de Graaf, Alexander Schrijver, Paul D. Seymour   +2 more
openaire   +3 more sources

Upper Vertex Triangle Free Detour Number of a Graph

, 2017
For a graph G, the x-triangle free detour set, the x-triangle free detour number, the minimal x-triangle free detour set, the upper x-triangle free detour number, are defined and studied.
Keerthi Asir, I, Athisayanathan, S, Sethu Ramalingam, S   +2 more
core   +1 more source

Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback

Advanced Robotics Research, EarlyView.
BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat, Ali Umut Kaypak, Prashanth Krishnamurthy, Ramesh Karri, Farshad Khorrami   +4 more
wiley   +1 more source

Covering the edges of a graph with triangles

Discrete Mathematics
Motivated by a question of \textit{P. Erdős} et al. [ibid. 150, No. 1--3, 89--101 (1996; Zbl 0857.05077)], the authors study the relationship between the following graph invariants. Let~\(G\) be an undirected graph. \begin{itemize} \item \(\rho_{\Delta}(G)\) is the minimum cardinality of a set consisting of edges and triangles that together cover~\(E(G)
Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang   +5 more
openaire   +6 more sources