Ioan Tomescu

发表

Bicyclic Connected Graphs Having Smallest Degree Distances

Mihaita Dragan, Ioan Tomescu, 2019, 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

On the general sum-connectivity index of connected graphs with given order and girth

Ioan Tomescu, I. Tomescu, 2016, Electron. J. Graph Theory Appl..

Le nombre maximal de colorations d'un graphe hamiltonien

Ioan Tomescu, 1976, Discret. Math..

Almost all digraphs have a kernel

Ioan Tomescu, I. Tomescu, 1990, Discret. Math..

Some Results on Chromaticity of Quasi-Linear Paths and Cycles

Ioan Tomescu, 2012, Electron. J. Comb..

The number of h-strongly connected digraphs with small diameter

Ioan Tomescu, 2001, Australas. J Comb..

Ordered h-hypertrees

Ioan Tomescu, 1992, Discret. Math..

Irreducible Coverings by Cliques and Sperner's Theorem

Ioan Tomescu, 2002, Electron. J. Comb..

Some Extremal Properties of the Degree Distance of a Graph

Ioan Tomescu, I. Tomescu, 1999, Discret. Appl. Math..

Problems in combinatorics and graph theory

Ioan Tomescu, 1985 .

Sunflower hypergraphs are chromatically unique

Ioan Tomescu, 2004, Discret. Math..

On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet

Ioan Tomescu, 1996, Theor. Comput. Sci..

Magic graphs with pendant edges

Edy Tri Baskoro, Ngurah Anak Agung Gede, Ioan Tomescu, 2011, Ars Comb..

Optimum Huffman Forests

Ioan Tomescu, 1997, J. Univers. Comput. Sci..

A method for minimizing the number of states for a restricted class of incompletely specified sequential machines

Ioan Tomescu, 2005, Mathematical systems theory.

Metric bases in digital geometry

Ioan Tomescu, Robert A. Melter, I. Tomescu, 1984, Comput. Vis. Graph. Image Process..

Path generated digital metrics

Ioan Tomescu, Robert A. Melter, I. Tomescu, 1983, Pattern Recognit. Lett..

On the number of trees having k edges in common with a graph of bounded degrees

Ioan Tomescu, 1997, Discret. Math..

Ordering connected graphs having small degree distances

Ioan Tomescu, 2010, Discret. Appl. Math..

Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet

Ioan Tomescu, I. Tomescu, 2008, J. Autom. Lang. Comb..

Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number

Ioan Tomescu, Muhammad Kamran Jamil, 2017, Discret. Appl. Math..

Maximal chromatic polynomials of connected planar graphs

Ioan Tomescu, I. Tomescu, 1990, J. Graph Theory.

Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs

Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary, 2009, Graphs Comb..

On the number of h-connected graphs with a fixed diameter

Ioan Tomescu, 2002, Discret. Math..

On Hamiltonian-connected regular graphs

Ioan Tomescu, I. Tomescu, 1983, J. Graph Theory.

The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity

Ioan Tomescu, 2001, DMTCS.

Unified extremal results for k-apex unicyclic graphs (trees)

Jianping Liu, Ioan Tomescu, Muhuo Liu, 2021, Discret. Appl. Math..

Optimum Extendible Prefix Codes

Cristian S. Calude, Ioan Tomescu, 1997, J. Univers. Comput. Sci..

On the Chromaticity of Multi-Bridge Hypergraphs

Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary, Akhlaq Ahmad Bhatti, 2009, Graphs Comb..

A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine

Ioan Tomescu, 1972, IEEE Transactions on Computers.

On the Connected Partition Dimension of a Wheel Related Graph

Ioan Tomescu, 2012, Computation, Physics and Beyond.

2-Connected graphs with minimum general sum-connectivity index

Ioan Tomescu, 2014, Discret. Appl. Math..

On Words Containing all Short Subwords

Ioan Tomescu, 1998, Theor. Comput. Sci..

On the Number of Subtrees for Almost All Graphs

Ioan Tomescu, 1994, Random Struct. Algorithms.

Complex Roots of a Polynomial: 10688

O. P. Lossers, Robin J. Chapman, Ioan Tomescu, 2000, Am. Math. Mon..

General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants

Ioan Tomescu, Rozica-Maria Tache, 2015, 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

Boolean distance for graphs

Frank Harary, Ioan Tomescu, Robert A. Melter, 1982, Discret. Math..

A Threshold Property Concerning Words Containing All Short Factors

Ioan Tomescu, 1998, Bull. EATCS.

On metric dimension of convex polytopes with pendant edges

Ioan Tomescu, Muhammad Imran, Abdul Qudair Baig, 2016, Ars Comb..

On the number of large h-hypergraphs with a fixed diameter

Ioan Tomescu, 2000, Discret. Math..

Asymptotic Properties of the Factors of Words Over a Finite Alphabet

Ioan Tomescu, I. Tomescu, 2005, Fundam. Informaticae.

On the number of irreducible coverings by edges of complete bipartite graphs

Ioan Tomescu, I. Tomescu, 1996, Discret. Math..

A Combinatorial Algorithm for Solving Covering Problems

Ioan Tomescu, 1973, IEEE Transactions on Computers.

Chromatic Coefficients of Linear Uniform Hypergraphs

Ioan Tomescu, I. Tomescu, 1998, J. Comb. Theory, Ser. B.

Properties of connected graphs having minimum degree distance

Ioan Tomescu, 2009, Discret. Math..

Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices

Ioan Tomescu, Kun Cheng, Muhuo Liu, 2020, Discret. Appl. Math..

Elementary Problems: E3409-E3414

Robert McNaughton, Donald E. Knuth, Gerald Myerson, 1990 .

On the chromaticity of sunflower hypergraphs SH(n, p, h)

Ioan Tomescu, 2007, Discret. Math..

Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs

Ioan Tomescu, Dragoş-Radu Popescu, 1996, Eur. J. Comb..

Almost all graphs and h-hypergraphs have small diameter

Ioan Tomescu, 2005, Australas. J Comb..

A characterization of the words occurring as factors in a minimum number of words

Ioan Tomescu, 2006, Theor. Comput. Sci..

On the number of words containing the factor (aba)k

Ioan Tomescu, 2007, Discret. Appl. Math..

Le nombre maximal de 3-colorations d'un graphe connexe

Ioan Tomescu, 1972, Discret. Math..

From rankings’ collinearity to counting SDR's via chromatic list expression

Liviu P. Dinu, Ioan Tomescu, 2009, Int. J. Comput. Math..

On Metric Dimension of Generalized Petersen Graphs P(n, 3)

Ioan Tomescu, Muhammad Imran, Abdul Qudair Baig, 2014, Ars Comb..

On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices

Ioan Tomescu, Misbah Arshad, 2015, Discret. Appl. Math..

On the partition dimension and connected partition dimension of wheels

Ioan Tomescu, Slamin, Imran Javaid, 2007, Ars Comb..

On the number of paths and cycles for almost all graphs and digraphs

Ioan Tomescu, 1986, Comb..

On 3-colorings of bipartite p-threshold graphs

Ioan Tomescu, I. Tomescu, 1987, J. Graph Theory.

Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number

Ioan Tomescu, I. Tomescu, 2018, Art Discret. Appl. Math..

On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques

Ioan Tomescu, 2002, COCOON.

Multi-level distance labelings for helm graphs

Ioan Tomescu, M. Tariq Rahim, 2012, Ars Comb..

Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices

Ioan Tomescu, Muhammad Kamran Jamil, Faisal Javaid, 2019, Discret. Appl. Math..

Maximal σ-polynomials of connected 3-chromatic graphs

Ioan Tomescu, 2003, J. Graph Theory.

A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network

Ioan Tomescu, I. Tomescu, 1970, IEEE Transactions on Computers.

Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index

Ioan Tomescu, Salma Kanwal, I. Tomescu, 2014, Discret. Appl. Math..

Discrepancies between metric dimension and partition dimension of a connected graph

Ioan Tomescu, 2008, Discret. Math..

On The Cyclomatic Number Of Linear Hypergraphs

Ioan Tomescu, Akhlaq Ahmad Bhatti, 2012, Ars Comb..

Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons

Ioan Tomescu, Alexandru T. Balaban, 1988, Discret. Appl. Math..

On the number of graphs and h-hypergraphs with bounded diameter

Ioan Tomescu, 2001, Discret. Math..

La reduction minimale d'un graphe a une reunion de cliques

Ioan Tomescu, 1974, Discret. Math..

Series-parallel chromatic hypergraphs

Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary, 2010, Discret. Appl. Math..

Graphical Eulerian numbers and chromatic generating functions

Ioan Tomescu, 1987, Discret. Math..

Metric Dimension and R-Sets of Connected Graphs

Muhammad Imran, Ioan Tomescu, I. Tomescu, 2011, Graphs Comb..

Elementary Problems: E3013-E3018

Ioan Tomescu, Charles W. Schelin, Eugene Levine, 1983 .

Hypertrees and Bonferroni inequalities

Ioan Tomescu, I. Tomescu, 1986, J. Comb. Theory, Ser. B.

Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets

Ioan Tomescu, 1981, Discret. Math..

On the number of occurrences of all short factors in almost all words

Ioan Tomescu, 2003, Theor. Comput. Sci..

On the Chromaticity of Quasi Linear Hypergraphs

Ioan Tomescu, Sana Javed, 2013, Graphs Comb..

An asymptotic formula for the number of graphs having small diameter

Ioan Tomescu, 1996, Discret. Math..

The Ramsey Numbers of Large cycles Versus Odd Wheels

Edy Tri Baskoro, Ioan Tomescu, Surahmat, 2008, Graphs Comb..

The Ramsey numbers of large cycles versus wheels

Edy Tri Baskoro, Ioan Tomescu, Surahmat, 2006, Discret. Math..

Maximum chromatic polynomials of 2-connected graphs

Ioan Tomescu, I. Tomescu, 1994, J. Graph Theory.

Digital metrics: A graph-theoretical approach

Frank Harary, Ioan Tomescu, Robert A. Melter, 1984, Pattern Recognit. Lett..

Maximum chromatic polynomial of 3-chromatic blocks

Ioan Tomescu, I. Tomescu, 1997, Discret. Math..

Extremal Bicyclic 3-Chromatic Graphs

Ioan Tomescu, Sana Javed, 2015, Graphs Comb..

First Reformulated Zagreb Index And Some Graph Operations

Ioan Tomescu, Muhammad Kamran Jamil, 2018, Ars Comb..

Le nombre minimal de colorations d'un hypergraphe k-chromatique

Ioan Tomescu, I. Tomescu, 1979, Discret. Math..

Negative Cycles in Complete Signed Graphs

Ioan Tomescu, Dragos Radu Popescu, 1996, Discret. Appl. Math..

Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2

Ioan Tomescu, 2019, Discret. Appl. Math..

Minimum Spanning Hypertrees

Ioan Tomescu, Marius Zimand, I. Tomescu, 1994, Discret. Appl. Math..

Hypergraphs with Pendant Paths are not Chromatically Unique

Ioan Tomescu, 2014, Discuss. Math. Graph Theory.

Extremal vertex-degree function index for trees and unicyclic graphs with given independence number

Ioan Tomescu, 2022, Discret. Appl. Math..

Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions

Ioan Tomescu, 2021, match Communications in Mathematical and in Computer Chemistry.

Advanced Problems: 5854-5859

Jan Mycielski, Ioan Tomescu, Stephen Gelbart, 1972 .

Ordering Trees Having Small General Sum-Connectivity Index 1

Ioan Tomescu, I. Tomescu, 2013 .

Extremal topological indices for graphs of given connectivity

Ioan Tomescu, Muhammad Kamran Jamil, Misbah Arshad, 2015 .

On an Integer Sequence Related to a Product of Trigonometric Functions, and its Combinatorial Relevance

Dorin Andrica, Ioan Tomescu, 2002 .

On the sum of all distances in chromatic blocks

Ioan Tomescu, I. Tomescu, 1994 .

On Metric and Partition Dimensions of Some Inflnite Regular Graphs

Ioan Tomescu, Muhammad Imran, 2009 .

Introduction to combinatorics

Ioan Tomescu, 1975 .

Maximum General Sum-Connectivity Index for Trees with Given Independence Number 1

Ioan Tomescu, I. Tomescu, Muhammad Jamil, 2014 .

On the Number of Trees Having k Edges in Common with a Caterpillar of Moderate Degrees

Ioan Tomescu, 1985 .

Some extremal results concerning the number of graph and hypergraph colorings

Ioan Tomescu, 1989 .

Maximal σ-polynomials of connected 3-chromatic graphs

Ioan Tomescu, 2003 .

Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs

Ioan Tomescu, 1981 .