Let [Formula: see text] be a simple, connected graph of order [Formula: see text] and size [Formula: see text] Then, [Formula: see text] is said to be edge [Formula: see text]-choosable, if there exists a collection of subsets of the edge set, [Formula: see text] of cardinality [Formula: see text] such that [Formula: see text] whenever [Formula: see text] and [Formula: see text] are incident. This paper initiates a study on edge [Formula: see text]-choosability of certain fundamental classes of graphs and determines the maximum value of [Formula: see text] for which the given graph [Formula: see text] is edge [Formula: see text]-choosable. Also, in this paper, the relation between edge choice number and other graph theoretic parameters is discussed and we have given a conjecture on the relation between edge choice number and matching number of a graph.
A signed graph [Formula: see text] is an ordered pair [Formula: see text] where [Formula: see text] is the underlying graph of [Formula: see text] with a signature function [Formula: see text]. Notions of signed distance and distance-compatible signed graphs were introduced recently. We characterize distance compatibility in the case of a connected signed graph. Also, we provide characterizations for distance compatibility in the case of the Cartesian product, two lexicographic products and the tensor product of signed graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.