Edward J. Farrell

According to our database, Edward J. Farrell authored at least 25 papers between 1962 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2016

D-Graphs For Graphs With Cyclomatic Number 1.

Edward J. Farrell, Andrew A. Hunte

Ars Comb., 2016

1995

The matching polynomial of a regular graph.

Robert A. Beezer, Edward J. Farrell

Discret. Math., 1995

1992

A Modeling Study of the North Atlantic with Emphasis on the Greenland-Iceland-Norwegian Sea.

Trond Aukrust, Josef M. Oberhuber, Edward J. Farrell, Peter M. Haugan

IBM Syst. J., 1992

1991

Visual interpretation of multidimensional computations and transistor design.

Edward J. Farrell, Perry A. Appino, Daniel Foty, Thomas D. Linton Jr.

IBM J. Res. Dev., 1991

Preface.

Edward J. Farrell

IBM J. Res. Dev., 1991

On matching coefficients.

Edward J. Farrell, J. M. Guo, Gregory M. Constantine

Discret. Math., 1991

1987

Visual Interpretation of Complex Data.

Edward J. Farrell

IBM Syst. J., 1987

1985

Animation and 3D Color Display of Multiple-Variable Data: Application to Semiconductor Design.

Edward J. Farrell, Steven E. Laux, Philip L. Corson, Edward M. Buturla

IBM J. Res. Dev., 1985

Animated 3D CT Imaging.

Edward J. Farrell, Wen C. Yang, Rosario A. Zappulla

IEEE Computer Graphics and Applications, 1985

1984

Matchings in pentagonal chains.

Edward J. Farrell, S. A. Wahid

Discret. Appl. Math., 1984

Matchings in benzene chains.

Edward J. Farrell, S. A. Wahid

Discret. Appl. Math., 1984

Color 3-D Imaging of Normal and Pathologic Intracranial Structures.

Edward J. Farrell, Rosario A. Zappulla, Wen C. Yang

IEEE Computer Graphics and Applications, 1984

1983

Color Display and Interactive Interpretation of Three-Dimensional Data.

Edward J. Farrell

IBM J. Res. Dev., 1983

Forest decompositions of ladders.

Edward J. Farrell

Discret. Math., 1983

1982

A note on the circuit polynomials and characteristic polynomials of wheels and ladders.

Edward J. Farrell

Discret. Math., 1982

Cycle decompositions of complete graphs.

Edward J. Farrell

Discret. Math., 1982

1981

Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2.

Edward J. Farrell

Discret. Math., 1981

1980

On chromatic coefficients.

Edward J. Farrell

Discret. Math., 1980

Chromatic roots - some observations and conjectures.

Edward J. Farrell

Discret. Math., 1980

1979

On a general class of graph polynomials.

Edward J. Farrell

J. Comb. Theory B, 1979

An introduction to matching polynomials.

Edward J. Farrell

J. Comb. Theory B, 1979

On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs.

Edward J. Farrell

Discret. Math., 1979

1977

On graphical partitions and planarity.

Edward J. Farrell

Discret. Math., 1977

1966

Minimum length matched filters for digital applications (Corresp.).

Edward J. Farrell

IEEE Trans. Inf. Theory, 1966

1962

Computer design: Applications of redundancy to improve the accuracy of binary systems.

Edward J. Farrell

Proceedings of the 1962 ACM national conference, Digest of technical papers, 1962