Results 91 to 100 of about 3,577 (286)

Game chromatic number of Cartesian and corona product graphs

open access: yes, 2018
The game chromatic number $\chi_g$ is investigated for Cartesian product $G\square H$ and corona product $G\circ H$ of two graphs $G$ and $H$. The exact values for the game chromatic number of Cartesian product graph of $S_{3}\square S_{n}$ is found ...
Syed Ahtsham Ul Haq BOKHARY   +5 more
core   +1 more source

Super Fair Dominating Set in the Cartesian Product of Graphs

open access: yes, 2020
In this paper, we characterize the super fair dominating set in the Cartesian product of two graphs and give some important ...
Enrico L. Enriquez, Glenna T. Gemina
core   +1 more source

BMPCQA: Bioinspired Metaverse Point Cloud Quality Assessment Based on Large Multimodal Models

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a bioinspired metaverse point cloud quality assessment metric, which simulates the human visual evaluation process to perform the point cloud quality assessment task. It first extracts rendering projection video features, normal image features, and point cloud patch features, which are then fed into a large multimodal model to ...
Huiyu Duan   +7 more
wiley   +1 more source

Constructing Node-Disjoint Routes in K-Ary N-Cubes

open access: yesSultan Qaboos University Journal for Science, 1997
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in ...
Khaled Day, Abdel Elah Al-Ayyoub
doaj   +1 more source

Asymmetric game perfect graphs and the circular coloring game of weighted graphs

open access: yes, 2011
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core  

Computing role assignments of Cartesian product of graphs

open access: yes, 2023
Network science is a growing field of study using Graph Theory as a modeling tool. In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles.
Julliano Rosa Nascimento   +3 more
core   +1 more source

SCP‐Pose: Leveraging Structural Consistency Prior Knowledge for Real‐Time Category‐Level 6D Pose Estimation

open access: yesAdvanced Intelligent Systems, EarlyView.
This paper presents a high‐speed object pose estimation method that deconstructs objects into geometric components. Inspired by human cognitive generalization, it detects these primitives and infers the 6D pose from their stable spatial configuration.
Xuyang Li   +6 more
wiley   +1 more source

Retract rigid cartesian products of graphs

open access: yesDiscrete Mathematics, 1988
A graph H is defined to be a retract of the graph G if there are edge- preserving maps \(f: V(H)\to V(G)\) and \(g: V(G)\to V(H)\) such that \(g(f(v))=v,\) for each \(v\in V(G)\) \((''v\in V(G)''\) appears in the paper, but \(''v\in V(H)''\) is correct). Thus H can be regarded as a subgraph of G.
Richard J. Nowakowski, Ivan Rival
openaire   +2 more sources

Vision‐Based Handover and Organization of Robotic Scrub Nurse for Seamless Surgical Flow

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a pose estimation‐based robotic scrub nurse (PERSN) that assists surgical procedures by estimating the surgeon's hand position, orientation, and grasping state, along with the constraint‐based 6D pose of surgical instruments. User evaluations show that PERSN provides greater immediate usability and reduces physical demand compared ...
Seongjoon Kang   +9 more
wiley   +1 more source

The Well-Covered Dimension Of Products Of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy