Indonesian Journal of Combinatorics
Vol 5, No 2 (2021)

The degree sequences of a graph with restrictions

Rikio Ichishima (Kokushikan University)
Francesc A. Muntaner-Batle (Unknown)
Miquel Rius-Font (Unknown)
Yukio Takahashi (Unknown)

Article Info

Publish Date
28 Dec 2021

Abstract

Two finite sequences s1 and s2 of nonnegative integers are called bigraphical if there exists a bipartite graph G with partite sets V1 and V2 such that s1 and s2 are the degrees in G of the vertices in V1 and V2, respectively. In this paper, we introduce the concept of 1-graphical sequences and present a necessary and sufficient condition for a sequence to be 1-graphical in terms of bigraphical sequences.

Copyrights © 2021




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Indonesian Journal of Combinatorics
Website

Abbrev

ijc

Publisher

Indonesian Combinatorial Society

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian ...