Results 31 to 40 of about 2,463 (224)

The development of cartesian product operation of product fuzzy graphs and its properties

open access: yesDesimal
The product fuzzy graph is an extension of the fuzzy graph definition by replacing the minimum operation with the product operation. This research is qualitative research with research stages consisting of determining open problems, constructing new ...
Fery Firmansah   +2 more
doaj   +1 more source

The Crossing Numbers of Products of Path with Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj   +1 more source

Distance antimagic labelings of Cartesian product of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho   +2 more
doaj   +1 more source

A New Framework to Approach Vizing’s Conjecture

open access: yesDiscussiones Mathematicae Graph Theory, 2021
We introduce a new setting for dealing with the problem of the domination number of the Cartesian product of graphs related to Vizing’s conjecture. The new framework unifies two different approaches to the conjecture.
Brešar Boštjan   +4 more
doaj   +1 more source

Partial Cartesian Graph Product

open access: yesCoRR, 2018
In this paper we define a new product-like binary operation on directed graphs, and we discuss some of its properties. We also briefly discuss its application in constructing the subtyping relation in generic nominally-typed object-oriented programming languages.
openaire   +3 more sources

Distinguishing Cartesian products of countable graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehsan Estaji   +4 more
openaire   +2 more sources

Power domination of the cartesian product of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs ...
K.M. Koh, K.W. Soh
doaj   +1 more source

Technical Feasibility Study of Autonomous Field Robot‐Based on‐the‐go Assessment of Soil Nutrients Using Ion‐Sensitive Field‐Effect Transistors

open access: yesAdvanced Robotics Research, EarlyView.
Autonomous field robots equipped with ISFET‐based sensors enable rapid, spatially resolved soil nutrient analysis directly in the field. An automated system based on the BoniRob platform is presented for standardized on‐site extraction and measurement of key macronutrients and soil pH.
Vadim Riedel   +3 more
wiley   +1 more source

Distance magic Cartesian product of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz   +3 more
openaire   +4 more sources

A Generative Neuro‐Symbolic AI for Protein Sequence Design

open access: yesAdvanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne   +12 more
wiley   +1 more source

Home - About - Disclaimer - Privacy