«linear graph»

Proving the Pressing Game Conjecture on Linear Graphs

The pressing game on black-and-white graphs is the following: Given a graph G(V,E) with its vertices colored with black and white, any black vertex v can be pressed, which has the following effect: (a) all neighbors of v change color, i.e. white neighbors become black and vice ve

An Optimizing Method for Embedding Linear Graphs in N-Cube

In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code

Features of using linear graphs in developing mathematical model of metal melting process in induction crucible furnace

The use of linear graphs in the development a mathematical model metal melting an induction crucible furnace allows to determine temperature and control excess main parts furnace. In addition, if it is necessary optimize thermal mode operation according presented graph conversion

Design and Simulation of a Fuzzy Trajectory Tracking Controller for Linear graph Four Wheel Skid-steer Mobile-Robot with Obstacle Avoidance

This article presents a Fuzzy Trajectory Tracking Controller for a Linear graph model of Four four-wheel skid-steer mobile robots by leveraging a state space model derived from McCormick's work focusing on navigation and obstacle avoidance. The study commences with designing The

Exploratory Data Analysis of Earthquake Moment Tensor Catalog in Japan Using Non-linear Graph-Based Dimensionality Reduction

Abstract The catalog of moment tensor solutions, which contains the information on spatial location, origin time and fault mechanism type earthquakes, has been interpreted by researchers based a wealth past knowledge. However, long-term routine analyses have led to accumulation h

Sets and Modern Non-Linear Graph Theory

Assume there exists a pseudo-elliptic monoid. We wish to extend the results of [39] to meromorphic, positive, contra-everywhere open planes. We show that E = ∅. It has long been known that u < i [39]. In [39], it is shown that sF,p 6= V ′′.

The Dissimilarity Characteristic of Linear Graphs

Moving up and Getting Steeper: Negotiating Shared Descriptions of Linear Graphs

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more

Constructive lower bounds for Ramsey numbers from linear graphs

Giraud (1968) demonstrated a process for constructing cyclic Ramsey graph colourings, starting from a known cyclic ‘prototype’ colouring, adding edges of a single new colour, and producing a larger cyclic pattern. This paper describes an extension of that construction which allow

A Practical Algorithm for [r, s, t]-Coloring of Graph

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for gr